On the number of small cut in a graph

DOI10.1016/0020-0190(96)00079-8zbMath1046.68630OpenAlexW2064211276MaRDI QIDQ1847367

David P. Williamson, Monika R. Henzinger

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00079-8

zbMATH Keywords

undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ Generalized cut trees for edge-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• An Õ(n²) algorithm for minimum cuts

This page was built for publication: On the number of small cut in a graph