On the planar integer two-flow problem

DOI10.1007/BF02579295zbMath0524.90035OpenAlexW2066091283MaRDI QIDQ585080

Michael V. Lomonosov

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579295

zbMATH Keywords

planar integer two-flow problemtwo-commodity flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

A heuristic solution procedure for multicommodity integer flows, On the integral plane two-commodity flow problem, Max-multiflow/min-multicut for G+H series-parallel, Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs, A fast algorithm for maximum integral two-commodity flow in planar graphs, Packing paths in planar graphs

Cites Work

• The matroids with the max-flow min-cut property
• On the Complexity of Timetable and Multicommodity Flow Problems
• Unnamed Item