• Aucun résultat trouvé

Flow problems in multi-interface networks

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Flow problems in multi-interface networks"

Copied!
15
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Loading

Figure

Fig. 1. The graph G and its transformation in the direct graph G ′ . W(s) = {1,2}, W (v) = 1,2,3, W (t) = X(v, t) = {2,3}, and X(s, v) = {1}
Fig. 2. The subgraphs used in the proofs of Theorems 4.2 and 5.1. r w 1 y 1 x 1 w 2 y 2 x 2 N (ℓ)xℓ−1yℓ−1wℓ−1xℓyℓ w ℓ T (5)
Fig. 4. The graph G in the transformation from X 3C to MCFMI D .
Fig. 5. Graphs G BIB : average upper bounds on the approximation ratios for
+4

Références

Télécharger maintenant ( PDF - 15 Page - 463.87 KB )

Documents relatifs

On the values of logarithmic residues along curves

By the results of part 3, the stratification by the values of logarithmic residues is the same as the stratification by the values of Kähler differentials which is an

On the upper bound of number-theoretic function

In this paper, we mainly focus on the three aforementioned functions, proving that they all satisfy this necessary condition, and approximately estimate the upper bound of.. Here

Our goal is to prove a sharp upper bound estimate for the bottom of the spectrum of the Laplacian on M

In this paper, our first goal is to show that indeed there is a sharp estimate for λ 1 (M) under Ricci curvature lower bound. To prove this, we will develop a new argument, that

On the problems of neural networks with multi-state neurons

This simple model however, does not represent the best performance that can be achieved for these networks, indeed the maximum storage capacity for uncorrelated patterns has been

Upper bound for the height of S-integral points on elliptic curves

has shown that one can also bound the height of integral points of an elliptic curve E using lower bounds for linear forms in elliptic logarithms, in a more natural way than

On the approximation of the exterior Stokes problem in three dimensions

M 2 AN Modélisation mathématique et Analyse numérique 0399-0516/87/03/445/20/$4.00 Mathematical Modelling and Numerical Analysis © AFCET Gauthier-Villa r s.. A variational

On the connection between the theory of signal flow graphs and the theory of directed graphs

For an undirected graph G(V> E, f) the degree of node ip(i) indicates the number of edges incident with i.. NIEDEREICHHOLZ.. only one edge, whereas an isolated node is a node

Average performance of the sparsest approximation in a dictionary

Average performance of the sparsest approximation using a general dictionary. CMLA Report n.2008-13, accepted with minor modifi- cations in Comptes Rendus de l’Acad´emie des