The following pages link to Multicommodity flows in graphs (Q1838904):
Displaying 15 items.
- Three commodity flows in graphs (Q594107) (← links)
- The hardness of routing two pairs on one face (Q662307) (← links)
- Packings of cuts realizing distances between certain vertices in a planar graph (Q804586) (← links)
- Edge-disjoint paths in a grid bounded by two nested rectangles (Q913521) (← links)
- The Klein bottle and multicommodity flows (Q920100) (← links)
- Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Distances and cuts in planar graphs (Q1121897) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- Half-integral flows in a planar graph with four holes (Q1842657) (← links)
- An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (Q2010919) (← links)
- A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes (Q3194707) (← links)
- Routing in grid graphs by cutting planes (Q4845139) (← links)
- (Q5020877) (← links)
