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

DOI10.1016/J.IPL.2006.06.001MaRDI QIDQ845841zbMATH OpenOpenAlexFDO

Authors Xianchao Zhang, W. Liang, He Jiang

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

data structuresflow equivalent treegraph algorithmsminimum cutnode-edge-capacitatedplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• Flow trees for vertex-capacitated networks
• Flow in planar graphs with vertex capacities
• Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
• Maximum flow in directed planar graphs with vertex capacities
• Maximum Flow in Directed Planar Graphs with Vertex Capacities
• Max Flows in Planar Graphs with Vertex Capacities
• Some flow-equivalent planar and non-planar graphs
• Min-Cost Flow in Unit-Capacity Planar Graphs
• scientific article; zbMATH DE number 431512
• Characterizing the flow equivalent trees of a network

Cites work

• Counterexamples for Directed and Node Capacitated Cut-Trees
• scientific article; zbMATH DE number 3441964 (Why is no real title available?)
• Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
• Multi-Terminal Network Flows
• Network flows. Theory, algorithms, and applications.

Cited in

(4)

• Characterizing the flow equivalent trees of a network
• Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
• Maximum flow in directed planar graphs with vertex capacities
• Flow trees for vertex-capacitated networks

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

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