Efficient Algorithms for the k Smallest Cuts Enumeration

Authors:
Li-Pu Yeh;Biing-Feng Wang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 17
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A polynomial algorithm for the k-cut problem for fixed k

Mathematics of Operations Research
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 faster deterministic maximum flow algorithm

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)
Computing All Small Cuts in an Undirected Network

SIAM Journal on Discrete Mathematics
Experimental study of minimum cut algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time

Journal of the ACM (JACM)
A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

SIAM Journal on Computing
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time

Journal of Algorithms
Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Deterministic Algorithm for Finding All Minimum $k$-Way Cuts

SIAM Journal on Computing
A new and improved algorithm for the 3-cut problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problems of enumerating cuts of a graph by non-decreasing weights. There are four problems, depending on whether the graph is directed or undirected, and on whether we consider all cuts of the graph or only s-tcuts for a given pair of vertices s, t. Efficient algorithms for these problems with ${\tilde{\mbox{O}}}(n^2m)$ delay between two successive outputs have been known since 1992, due to Vazirani and Yannakakis. In this paper, improved algorithms are presented. The delays of the presented algorithms are O(nmlog(n2/m)).