Standard
Min st-cut oracle for planar graphs with near-linear preprocessing time. / Borradaile, Glencora; Sankowski, Piotr; Wulff-Nilsen, Christian.
In:
A C M Transactions on Algorithms, Vol. 11, No. 3, 16, 2015, p. 16:1-16:29.
Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Borradaile, G, Sankowski, P
& Wulff-Nilsen, C 2015, '
Min st-cut oracle for planar graphs with near-linear preprocessing time',
A C M Transactions on Algorithms, vol. 11, no. 3, 16, pp. 16:1-16:29.
https://doi.org/10.1145/2684068APA
Borradaile, G., Sankowski, P.
, & Wulff-Nilsen, C. (2015).
Min st-cut oracle for planar graphs with near-linear preprocessing time.
A C M Transactions on Algorithms,
11(3), 16:1-16:29. [16].
https://doi.org/10.1145/2684068Vancouver
Borradaile G, Sankowski P
, Wulff-Nilsen C.
Min st-cut oracle for planar graphs with near-linear preprocessing time.
A C M Transactions on Algorithms. 2015;11(3):16:1-16:29. 16.
https://doi.org/10.1145/2684068Author
Borradaile, Glencora ; Sankowski, Piotr ; Wulff-Nilsen, Christian. / Min st-cut oracle for planar graphs with near-linear preprocessing time. In: A C M Transactions on Algorithms. 2015 ; Vol. 11, No. 3. pp. 16:1-16:29.
Bibtex
@article{2a806341be67427ba8ede1cfeaee5bcf,
title = "Min st-cut oracle for planar graphs with near-linear preprocessing time",
keywords = "Minimum cut, minimum cycle basis, planar graphs",
author = "Glencora Borradaile and Piotr Sankowski and Christian Wulff-Nilsen",
year = "2015",
doi = "10.1145/2684068",
language = "English",
volume = "11",
pages = "16:1--16:29",
journal = "ACM Transactions on Algorithms",
issn = "1549-6325",
publisher = "Association for Computing Machinery, Inc.",
number = "3",
}
RIS
TY - JOUR
T1 - Min st-cut oracle for planar graphs with near-linear preprocessing time
AU - Borradaile, Glencora
AU - Sankowski, Piotr
AU - Wulff-Nilsen, Christian
PY - 2015
Y1 - 2015
KW - Minimum cut, minimum cycle basis, planar graphs
U2 - 10.1145/2684068
DO - 10.1145/2684068
M3 - Journal article
VL - 11
SP - 16:1-16:29
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
SN - 1549-6325
IS - 3
M1 - 16
ER -
