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

DOI10.1016/S0020-0190(99)00071-XMaRDI QIDQ1606951zbMATH OpenOpenAlexWikidataFDO

Authors S. R. Arikati, K. Mehlhorn

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)

Recommendations

• Fundamentals of Computation Theory
• A simple min-cut algorithm
• A simple and fast min-cut algorithm
• scientific article; zbMATH DE number 437525
• scientific article; zbMATH DE number 742961

Cited in

(5)

• scientific article; zbMATH DE number 7561367 (Why is no real title available?)
• Minimum cuts and sparsification in hypergraphs
• Minimum degree orderings
• Certifying algorithms
• Computing vertex-disjoint paths in large graphs using MAOs

This page was built for publication: A correctness certificate for the Stoer-Wagner min-cut algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606951)