Minimum Cuts in Near-Linear Time

Details Minimum Cuts in Near-Linear Time Minimum Cuts in Near-Linear Time

1998-12-08

arxiv.org/abs/cs/9812007v1

Computer Science

Data Structures and Algorithms

Scientific paper

We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a ``semi-duality'' between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized algorithm that finds a minimum cut in an m-edge, n-vertex graph with high probability in O(m log^3 n) time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in O(n^2 log n) time. This variant has an optimal RNC parallelization. Both variants improve on the previous best time bound of O(n^2 log^3 n). Other applications of the tree-packing approach are new, nearly tight bounds on the number of near minimum cuts a graph may have and a new data structure for representing them in a space-efficient manner.

Affiliated with

Also associated with

No associations

Rating

Minimum Cuts in Near-Linear 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 Minimum Cuts in Near-Linear Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Cuts in Near-Linear Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310289