Standard
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
Harvard
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.2746588APA
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 (pp. 665-674). Association for Computing Machinery.
https://doi.org/10.1145/2746539.2746588Vancouver
Kawarabayashi K
, Thorup M.
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. 2015. p. 665-674
https://doi.org/10.1145/2746539.2746588Author
Kawarabayashi, Ken-ichi ; Thorup, Mikkel. / Deterministic global minimum cut of a simple graph in near-linear time. Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing: STOC '15. Association for Computing Machinery, 2015. pp. 665-674
Bibtex
@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",
}
RIS
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 -
