A correctness certificate for the Stoer-Wagner min-cut algorithm

DOI10.1016/S0020-0190(99)00071-XzbMath0990.05114OpenAlexW2137762774WikidataQ127846793 ScholiaQ127846793MaRDI QIDQ1606951

Kurt Mehlhorn, Srinivasa R. Arikati

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00071-x

zbMATH Keywords

minimum cutStoer-Wagner algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Minimum degree orderings, Minimum Cuts and Sparsification in Hypergraphs, Certifying algorithms, Unnamed Item, Computing vertex-disjoint paths in large graphs using MAOs