On the planar integer two-flow problem

DOI10.1007/BF02579295zbMATH Open0524.90035OpenAlexW2066091283MaRDI QIDQ585080FDOQ585080

Authors: 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)

Cites Work

• Title not available (Why is that?)
• On the Complexity of Timetable and Multicommodity Flow Problems
• The matroids with the max-flow min-cut property

Cited In (6)

• 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
• A heuristic solution procedure for multicommodity integer flows
• Packing paths in planar graphs
• On the integral plane two-commodity flow problem
• Max-multiflow/min-multicut for G+H series-parallel

This page was built for publication: On the planar integer two-flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585080)