Multicommodity flows in graphs

DOI10.1016/0166-218X(83)90100-2zbMath0509.90030OpenAlexW2062577352MaRDI QIDQ1838904

Haruko Okamura

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90100-2

zbMATH Keywords

planar graphmulticommodity flowsexistence of feasible flowsinteger-valued capacityinteger-valued demands

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Edge-disjoint homotopic paths in a planar graph with one hole, A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes, Three commodity flows in graphs, Algorithms for multicommodity flows in planar graphs, On fractional multicommodity flows and distance functions, Distances and cuts in planar graphs, Routing in grid graphs by cutting planes, Edge-disjoint paths in a grid bounded by two nested rectangles, Unnamed Item, The Klein bottle and multicommodity flows, The hardness of routing two pairs on one face, An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes, On max-flow min-cut and integral flow properties for multicommodity flows in directed networks, Half-integral flows in a planar graph with four holes, Packings of cuts realizing distances between certain vertices in a planar graph

Cites Work

• Multicommodity flows in planar graphs
• Maximal Flow Through a Network
• Multi-Commodity Network Flows