License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SWAT.2020.12
URN: urn:nbn:de:0030-drops-122594
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12259/
Go to the corresponding LIPIcs Volume Portal


Bhardwaj, Nalin ; Molina Lovett, Antonio J. ; Sandlund, Bryce

A Simple Algorithm for Minimum Cuts in Near-Linear Time

pdf-format:
LIPIcs-SWAT-2020-12.pdf (0.5 MB)


Abstract

We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that 2-respects (cuts two edges of) a spanning tree T of a graph G. This procedure can be used in place of the complicated subroutine given in Karger’s near-linear time minimum cut algorithm [Karger, 2000]. We give a self-contained version of Karger’s algorithm with the new procedure, which is easy to state and relatively simple to implement. It produces a minimum cut on an m-edge, n-vertex graph in O(m log³ n) time with high probability, matching the complexity of Karger’s approach.

BibTeX - Entry

@InProceedings{bhardwaj_et_al:LIPIcs:2020:12259,
  author =	{Nalin Bhardwaj and Antonio J. Molina Lovett and Bryce Sandlund},
  title =	{{A Simple Algorithm for Minimum Cuts in Near-Linear Time}},
  booktitle =	{17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)},
  pages =	{12:1--12:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-150-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{162},
  editor =	{Susanne Albers},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12259},
  URN =		{urn:nbn:de:0030-drops-122594},
  doi =		{10.4230/LIPIcs.SWAT.2020.12},
  annote =	{Keywords: minimum cut, sparsification, near-linear time, packing}
}

Keywords: minimum cut, sparsification, near-linear time, packing
Collection: 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Issue Date: 2020
Date of publication: 12.06.2020
Supplementary Material: Our implementation is available at: https://github.com/nalinbhardwaj/min-cut-paper.


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI