Deterministic global minimum cut of a simple graph in near-linear time

Ken-ichi Kawarabayashi, Mikkel Thorup

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

40 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing : STOC '15
Number of pages	10
Publisher	Association for Computing Machinery
Publication date	2015
Pages	665-674
ISBN (Print)	978-1-4503-3536-2
DOIs	https://doi.org/10.1145/2746539.2746588
Publication status	Published - 2015
Event	Annual ACM Symposium on the Theory of Computing 2015 - Portland, United States Duration: 15 Jun 2015 → 17 Jun 2015 Conference number: 47

Conference	Annual ACM Symposium on the Theory of Computing 2015
Number	47
Country/Territory	United States
City	Portland
Period	15/06/2015 → 17/06/2015

Access to Document

Deterministic global minimum cut of a simple graph in near-linear time. / Kawarabayashi, Ken-ichi; Thorup, Mikkel.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing: STOC '15. Association for Computing Machinery, 2015. p. 665-674.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Kawarabayashi, K & Thorup, M 2015, Deterministic global minimum cut of a simple graph in near-linear time. in Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing: STOC '15. Association for Computing Machinery, pp. 665-674, Annual ACM Symposium on the Theory of Computing 2015, Portland, United States, 15/06/2015. https://doi.org/10.1145/2746539.2746588

@inproceedings{bde7fb5a267444e7be2137abe26590a6,

title = "Deterministic global minimum cut of a simple graph in near-linear time",

keywords = "deterministic near-linear time, edge connectivity, minimum cut, simple graphs",

author = "Ken-ichi Kawarabayashi and Mikkel Thorup",

year = "2015",

doi = "10.1145/2746539.2746588",

language = "English",

isbn = "978-1-4503-3536-2",

pages = "665--674",

booktitle = "Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

note = "Annual ACM Symposium on the Theory of Computing 2015, STOC '15 ; Conference date: 15-06-2015 Through 17-06-2015",

}

TY - GEN

T1 - Deterministic global minimum cut of a simple graph in near-linear time

AU - Kawarabayashi, Ken-ichi

AU - Thorup, Mikkel

N1 - Conference code: 47

PY - 2015

Y1 - 2015

KW - deterministic near-linear time, edge connectivity, minimum cut, simple graphs

U2 - 10.1145/2746539.2746588

DO - 10.1145/2746539.2746588

M3 - Article in proceedings

SN - 978-1-4503-3536-2

SP - 665

EP - 674

BT - Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing

PB - Association for Computing Machinery

T2 - Annual ACM Symposium on the Theory of Computing 2015

Y2 - 15 June 2015 through 17 June 2015

ER -