Flow equivalent trees in undirected node-edge-capacitated planar graphs

DOI10.1016/j.ipl.2006.06.001zbMath1185.05143OpenAlexW1974774549MaRDI QIDQ845841

Xianchao Zhang, He Jiang, Weifa Liang

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.001

zbMATH Keywords

minimum cutplanar graphsdata structuresgraph algorithmsflow equivalent treenode-edge-capacitated

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities ⋮ Maximum flow in directed planar graphs with vertex capacities

Cites Work

• Multi-Terminal Network Flows
• Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
• Counterexamples for Directed and Node Capacitated Cut-Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Flow equivalent trees in undirected node-edge-capacitated planar graphs