Compact Representations of Cuts

DOI10.1137/S0895480196312334zbMath0997.90093MaRDI QIDQ2706189

David B. Hartvigsen

Publication date: 19 March 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

min-cut\(k\)-cutflow tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Flow trees for vertex-capacitated networks

This page was built for publication: Compact Representations of Cuts