@inproceedings{b9e6cf54177a4cd1acafb0d624a064ff,
title = "Minimum cut in O(m log2 n) time",
abstract = "We give a randomized algorithm that finds a minimum cut in an undirected weighted m-edge n-vertex graph G with high probability in O(mlog2 n) time. This is the first improvement to Karger's celebrated O(mlog3 n) time algorithm from 1996. Our main technical contribution is a deterministic O(mlog n) time algorithm that, given a spanning tree T of G, finds a minimum cut of G that 2-respects (cuts two edges of) T.",
keywords = "Minimum 2-respecting cut, Minimum cut",
author = "Pawe{\l} Gawrychowski and Shay Mozes and Oren Weimann",
note = "Funding Information: Funding Shay Mozes: Supported in part by Israel Science Foundation grant 592/17. Oren Weimann: Supported in part by Israel Science Foundation grant 592/17. Publisher Copyright: {\textcopyright} Pawe{\l} Gawrychowski, Shay Mozes, and Oren Weimann; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020).; 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 ; Conference date: 08-07-2020 Through 11-07-2020",
year = "2020",
month = jun,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.ICALP.2020.57",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Artur Czumaj and Anuj Dawar and Emanuela Merelli",
booktitle = "47th International Colloquium on Automata, Languages, and Programming, ICALP 2020",
address = "Germany",
}