A new and improved algorithm for the 3-cut problem

Authors:
Michel Burlet;Olivier Goldschmidt
Affiliations:
Laboratoire LEIBNIZ, IMAG, Grenoble, France;Laboratoire LEIBNIZ, IMAG, Grenoble, France
Venue:
Operations Research Letters
Year:
1997

Citing 4
Cited 10

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
A polynomial algorithm for the k-cut problem for fixed k

Mathematics of Operations Research
Computing All Small Cuts in Undirected Networks

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation

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
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On generalized greedy splitting algorithms for multiway partition problems

Discrete Applied Mathematics
Efficient Algorithms for the k Smallest Cuts Enumeration

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Finding minimum 3-way cuts in hypergraphs

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding minimum 3-way cuts in hypergraphs

Information Processing Letters
Two-Server network disconnection problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Generating partitions of a graph into a fixed number of minimum weight cuts

Discrete Optimization
Clique cover and graph separation: new incompressibility results

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a O(mn^3) time exact algorithm for finding a minimum 3-cut in an edge-weighted graph. This running time compares very favorably with the best-known algorithm which takes O(mn^5) time in the worst case.