Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
From MaRDI portal
Publication:6608037
Recommendations
Cites work
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- scientific article; zbMATH DE number 5485527 (Why is no real title available?)
- scientific article; zbMATH DE number 3906193 (Why is no real title available?)
- scientific article; zbMATH DE number 7788402 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A new approach to the minimum cut problem
- Algorithmic Aspects of Graph Connectivity
- An FPT algorithm beating 2-approximation for \(k\)-cut
- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
- Canonical decompositions of symmetric submodular systems
- Computing All Small Cuts in an Undirected Network
- Computing minimum multiway cuts in hypergraphs
- Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\)
- Cutsets and partitions of hypergraphs
- Decomposition of submodular functions
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Edge-augmentation of hypergraphs
- Finding k Cuts within Twice the Optimal
- Finding minimum 3-way cuts in hypergraphs
- Greedy splitting algorithms for approximating multiway partition problems
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Hypergraph \(k\)-cut in randomized polynomial time
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
- LP relaxation and tree packing for minimum \(k\)-cut
- Minimizing submodular functions over families of sets
- Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
- Minimum cuts and sparsification in hypergraphs
- Minimum cuts in near-linear time
- On the number of small cut in a graph
- Random contractions and sampling for hypergraph and hedge connectivity
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Suboptimal cuts: their enumeration, weight and number (extended abstract)
- The Complexity of Multiterminal Cuts
- The Karger-Stein algorithm is optimal for k-cut
- The number of minimum \(k\)-cuts: improving the Karger-Stein bound
This page was built for publication: Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608037)
