Min st-cut oracle for planar graphs with near-linear preprocessing time

Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen

Research output: Contribution to journal › Journal article › Research › peer-review

8 Citations (Scopus)

Original language	English
Article number	16
Journal	A C M Transactions on Algorithms
Volume	11
Issue number	3
Pages (from-to)	16:1-16:29
ISSN	1549-6325
DOIs	https://doi.org/10.1145/2684068
Publication status	Published - 2015

Access to Document

@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",

}

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 -