Results 11 to 20 of about 381 (184)
Matroids and Multicommodity Flows
European Journal of Combinatorics, 1981 The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalities between the maximum feasible packing of certain circuits of a graph and the minimum capacity of certain cocircuits, and thus may both be expressed in matroid terms. We study the matroids in which a similar “k-commodity flow theorem” holds. (Thus for k =
Seymour, P.D.
openaire +2 more sources
Criticality for multicommodity flows
Journal of Combinatorial Theory, Series B, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seymour, Paul D.
openaire +2 more sources
Multicommodity flows in planar graphs
Journal of Combinatorial Theory, Series B, 1981 Suppose that G is a graph, and (si, ti) (1≤i≤k) are pairs of vertices; and that each edge has a real-valued capacity (≥0), and that qi≥0 (1≤i≤k) are realvalued demands. When is there a flow for each i, between si and ti and of value qi, such that the total flow through each edge does not exceed its capacity? Ford and Fulkerson solved this when k=1, and
Haruko Okamura, Paul D. Seymour
openaire +2 more sources
Multicommodity flows in graphs
Discrete Applied Mathematics, 1983 AbstractSuppose that G is a graph, and (si,ti) (1≤i≤k) are pairs of vertices; and that each edge has a integer-valued capacity (≥0), and that qi≥0 (1≤i≤k) are integer-valued demands. When is there a flow for each i, between si and ti and of value qi, such that the total flow through each edge does not exceed its capacity? Ford and Fulkerson solved this
Haruko OKAMURA, Okamura, Haruko
openaire +2 more sources
Multicommodity flows in cycle graphs
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Myung, Young-Soo
openaire +3 more sources
Loops in multicommodity flows [PDF]
1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications, 1977 Given the traffic flow from each source to each destination in a network and given the aggregate traffic in each link, we want to find if there is any looping of traffic. A careful definition of looping shows that the question is equivalent to whether some of the aggregate link flows can be reduced without increasing any of the others. It is then shown,
Robert Gallager
core +4 more sources
Multicommodity flows and polyhedra [PDF]
CWI Quarterly, 1993 Summary: P. D. Seymour's conjecture on binary clutters with the so-called weak (or \(\mathbb{Q}_ +\)-) max-flow min-cut property implies -- if true -- a wide variety of results in combinatorial optimization about objects ranging from matchings to (multicommodity) flows and disjoint paths.
Gerards, A.M.H. (Bert) +3 more
openaire +4 more sources
Multicommodity Flows in Planar Graphs with Demands on Faces [PDF]
, 2020 We consider the problem of multicommodity flows in planar graphs. Seymour [Seymour, 1981] showed that if the union of supply and demand graphs is planar, then the cut condition is also sufficient for routing demands. Okamura-Seymour [Okamura and Seymour,
Kumar, Nikhil
core +1 more source
Short proofs on multicommodity flows and cuts [PDF]
, 1991 We give a short proof of a theorem of Karzanov on the packing of cuts, and derive a theorem of Lomonosov on the existence of integer multicommodity flows (implying theorems of Hu, Rothschild and Whinston, Dinits, Papernov, and Seymour)
Schrijver, Lex +2 more
core +1 more source
Multicommodity flows and cuts in polymatroidal networks [PDF]
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012 We consider multicommodity flow and cut problems in {\em polymatroidal} networks where there are submodular capacity constraints on the edges incident to a node. Polymatroidal networks were introduced by Lawler and Martel and Hassin in the single-commodity setting and are closely related to the submodular flow model of Edmonds and Giles; the well-known
Chandra Chekuri +3 more
openaire +2 more sources