Min st-Cut of a Planar Graph in O(n loglog n) Time

Details Min st-Cut of a Planar Graph in O(n loglog n) Time Min st-Cut of a Planar Graph in O(n loglog n) Time

2010-07-21

arxiv.org/abs/1007.3609v2

Computer Science

Discrete Mathematics

Added mainly details and corrections to the r-division section

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Min st-Cut of a Planar Graph in O(n loglog n) Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Min st-Cut of a Planar Graph in O(n loglog n) Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Min st-Cut of a Planar Graph in O(n loglog n) Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183621