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
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
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 hypergraph min-cut algorithm for circuit partitioning
Integration, the VLSI Journal
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 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
A new and improved algorithm for the 3-cut problem
Operations Research Letters
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters
Computing minimum multiway cuts in hypergraphs from hypertree packings
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
The minimum 3-way cut problem in an edge-weighted hypergraph is to find a partition of the vertices into 3 sets minimizing the total weight of hyperedges with at least two endpoints in two different sets. In this paper we present some structural properties for minimum 3-way cuts and design an O(dmn3) algorithm for the minimum 3-way cut problem in hypergraphs, where n and m are the numbers of vertices and edges respectively, and d is the sum of the degrees of all the vertices. Our algorithm is the first deterministic algorithm finding minimum 3-way cuts in hypergraphs.