Criticality for multicommodity flows
From MaRDI portal
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- Combinatorial approaches to multiflow problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Disjoint paths in graphs
- Four-terminus flows
- Geometric algorithms and combinatorial optimization
- Graph minors. XIII: The disjoint paths problem
- Graph searching and a min-max theorem for tree-width
- Half-integral five-terminus flows
- Multi-Commodity Network Flows
- Multicommodity flows in planar graphs
- On Odd Cuts and Plane Multicommodity Flows
- On the complexity of the disjoint paths problem
- Quickly excluding a planar graph
- Rooted grid minors
- The directed subgraph homeomorphism problem
- The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Cited in
(9)- Methods of the convex cone theory in the feasibility problem of multicommodity flow
- Multiple weak 2-linkage and its applications on integer flows of signed graphs
- scientific article; zbMATH DE number 3947966 (Why is no real title available?)
- scientific article; zbMATH DE number 1327275 (Why is no real title available?)
- Substitutes, complements, and ripples in multicommodity flows on suspension graphs
- On the 3-Commodity Flow Problem
- Multiflows in symmetric digraphs
- Immersion in four-edge-connected graphs
- The Klein bottle and multicommodity flows
This page was built for publication: Criticality for multicommodity flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473104)