Flow trees for vertex-capacitated networks

DOI10.1016/j.dam.2006.08.012zbMath1121.90028OpenAlexW2000348096MaRDI QIDQ869579

Asaf Levin, Refael Hassin

Publication date: 8 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.08.012

zbMATH Keywords

cut-treecompact representationflow-tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (2)

Solution methods for the vertex variant of the network system vulnerability analysis problem ⋮ Unnamed Item

Cites Work

• Multi-terminal maximum flows in node-capacitated networks
• Ancestor tree for arbitrary multi-terminal cut functions
• Multiterminal xcut problems
• Generalizing the all-pairs min cut problem
• An algorithm for computing maximum solution bases
• Compact Representations of Cuts
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows
• Efficient algorithms for generalized cut‐trees
• Counterexamples for Directed and Node Capacitated Cut-Trees
• The Number of Solutions Sufficient for Solving a Family of Problems

This page was built for publication: Flow trees for vertex-capacitated networks