Finding robust minimum cuts

DOI10.1007/978-3-319-07956-1_12MaRDI QIDQ5251640zbMATH OpenOpenAlexFDO

Authors Barbara Geissmann, Rastislav Šrámek

Publication date 20 May 2015

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07956-1_12

Mathematics Subject Classification ID

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

Recommendations

• A new approach to the minimum cut problem
• Practical minimum cut algorithms
• Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
• Minimum cuts in near-linear time
• scientific article; zbMATH DE number 742961

Cited in

(3)

• Robust optimization in the presence of uncertainty: a generic approach
• Detecting robust cliques in graphs subject to uncertain edge failures
• Fully-dynamic min-cut

This page was built for publication: Finding robust minimum cuts

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