scientific article; zbMATH DE number 1769310

DOI10.1002/(SICI)1097-0037(199808)32:1%3C67::AID-NET5%3E3.0.CO;2-HMaRDI QIDQ4540065zbMATH OpenFDO

Authors Raanan Manor, Michal Penn

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199808)32:1%3C67::AID-NET5%3E3.0.CO;2-H

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Recommendations

• Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
• Maximum flow in directed planar graphs with vertex capacities
• A fast algorithm for maximum integral two-commodity flow in planar graphs
• On the integral plane two-commodity flow problem
• An O(n\log ^2 n) Algorithm for Maximum Flow in Undirected Planar Networks

Cited in

(6)

• On the integral plane two-commodity flow problem
• Graphs with no \(K_{3,3}\) minor containing a fixed edge
• Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
• \(K_{3,3}\) minors and the maximum-flow problem
• scientific article; zbMATH DE number 4090822 (Why is no real title available?)
• Extending planar graph algorithms to \(K_{3,3}\)-free graphs

This page was built for publication:

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