A simple and fast min-cut algorithm

DOI10.1007/s00224-007-2010-2zbMath1117.05066OpenAlexW1999602503MaRDI QIDQ2642908

Michael Brinkmeier

Publication date: 6 September 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-2010-2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (4)

A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ Minimum Cuts of Simple Graphs in Almost Always Linear Time ⋮ I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs

This page was built for publication: A simple and fast min-cut algorithm