Min st-Cut of a Planar Graph in O(n loglog n) Time
Discrete Mathematics
2010-10-08 v2
Abstract
Given a planar undirected n-vertex graph G with non-negative edge weights, we show how to compute, for given vertices s and t in G, a min st-cut in G in O(n loglog n) time and O(n) space. The previous best time bound was O(n log n).
Cite
@article{arxiv.1007.3609,
title = {Min st-Cut of a Planar Graph in O(n loglog n) Time},
author = {Christian Wulff-Nilsen},
journal= {arXiv preprint arXiv:1007.3609},
year = {2010}
}
Comments
Added mainly details and corrections to the r-division section