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

DOI10.1016/J.IPL.2006.06.001zbMATH Open1185.05143OpenAlexW1974774549MaRDI QIDQ845841FDOQ845841

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

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

zbMATH Keywords

data structuresgraph algorithmsminimum cutplanar graphsflow equivalent treenode-edge-capacitated

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Multi-Terminal Network Flows
• Title not available (Why is that?)
• Counterexamples for Directed and Node Capacitated Cut-Trees
• Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time

Cited In (4)

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

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)