A near-linear time algorithm for constructing a cactus representation of minimum cuts

Authors:
David R. Karger;Debmalya Panigrahi
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Year:
2009

Citing 6
Cited 0

A data structure for dynamic trees

Journal of Computer and System Sciences
Applications of a poset representation to edge connectivity and graph rigidity

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
A faster algorithm for finding the minimum cut in a directed graph

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A new approach to the minimum cut problem

Journal of the ACM (JACM)
Minimum cuts in near-linear time

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an Õ(m) (near-linear) time Monte Carlo algorithm for constructing the cactus data structure, a useful representation of all the global minimum edge cuts of an undirected graph. Our algorithm represents a fundamental improvement over the best previous (quadratic time) algorithms: because there can be quadratically many min-cuts, our algorithm must avoid looking at all min-cuts during the construction, but nonetheless builds a data structure representing them all. Our result closes the gap between the (near-linear) time required to find a single min-cut and that for (implicitly) finding all the min-cuts.