Criticality for multicommodity flows
From MaRDI portal
Publication:473104
DOI10.1016/j.jctb.2014.08.001zbMath1303.05078OpenAlexW2083011219MaRDI QIDQ473104
Publication date: 21 November 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2014.08.001
Trees (05C05) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items
Multiple weak 2-linkage and its applications on integer flows of signed graphs ⋮ Immersion in four-edge-connected graphs
Cites Work
- Unnamed Item
- Rooted grid minors
- Half-integral five-terminus flows
- A new polynomial-time algorithm for linear programming
- Combinatorial approaches to multiflow problems
- The directed subgraph homeomorphism problem
- Disjoint paths in graphs
- Multicommodity flows in planar graphs
- Geometric algorithms and combinatorial optimization
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- Graph searching and a min-max theorem for tree-width
- Quickly excluding a planar graph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Graph minors. XIII: The disjoint paths problem
- On the complexity of the disjoint paths problem
- Four-terminus flows
- On Odd Cuts and Plane Multicommodity Flows
- Multi-Commodity Network Flows
