Ancestor tree for arbitrary multi-terminal cut functions

DOI10.1007/BF02115755zbMath0741.90079OpenAlexW157855400MaRDI QIDQ1179737

S. Singh

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02115755

zbMATH Keywords

max-flow min-cut theoremcuts of a network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Dynamic programming and graph optimization problems ⋮ A note on minimizing submodular functions ⋮ The multi-layered network design problem ⋮ Tight Bounds for Gomory-Hu-like Cut Counting ⋮ An algorithm for computing maximum solution bases ⋮ Flow trees for vertex-capacitated networks ⋮ A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks ⋮ Reconstructing edge-disjoint paths faster ⋮ Exact solution of multicommodity network optimization problems with general step cost functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal Flow Through a Network
• The maximum concurrent flow problem
• Very Simple Methods for All Pairs Network Flow Analysis
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows

This page was built for publication: Ancestor tree for arbitrary multi-terminal cut functions