A simple minimum \(T\)-cut algorithm

DOI10.1016/S0166-218X(03)00182-3zbMath1031.68139MaRDI QIDQ1406048

Romeo Rizzi

Publication date: 9 September 2003

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

zbMATH Keywords

Gomory-Hu tree\(T\)-cut\(T\)-pairingMinimum \(T\)-cut

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Matching theory
• Minimum \(T\)-cuts and optimal \(T\)-pairings
• Multi-Terminal Network Flows
• Odd Minimum Cut-Sets and b-Matchings

This page was built for publication: A simple minimum \(T\)-cut algorithm