A divide-and-conquer approach to the minimum k-way cut problem.
From MaRDI portal
Publication:5957576
Recommendations
Cited in
(16)- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- Hypergraph \(k\)-cut in randomized polynomial time
- Finding Minimum 3-Way Cuts in Hypergraphs
- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Computing finest mincut partitions of a graph and application to routing problems
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- scientific article; zbMATH DE number 1445372 (Why is no real title available?)
- scientific article; zbMATH DE number 1522944 (Why is no real title available?)
- Finding minimum 3-way cuts in hypergraphs
- Efficient Algorithms for the k Smallest Cuts Enumeration
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- On minimum 3-cuts and approximating k-cuts using cut trees
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
- A fast algorithm for computing minimum 3-way and 4-way cuts
This page was built for publication: A divide-and-conquer approach to the minimum \(k\)-way cut problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957576)
