Computing minimum multiway cuts in hypergraphs
From MaRDI portal
Recommendations
- Computing minimum cuts in hypergraphs
- Computing minimum multiway cuts in hypergraphs from hypertree packings
- Minimum cuts and sparsification in hypergraphs
- Finding Minimum 3-Way Cuts in Hypergraphs
- Finding minimum 3-way cuts in hypergraphs
- On computing minimum(s,t)-cuts in digraphs
- Minimum cutsets in hypercubes
- scientific article; zbMATH DE number 7559431
- Counting the number of minimum cuts in undirected multigraphs
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
Cites work
- scientific article; zbMATH DE number 5485527 (Why is no real title available?)
- scientific article; zbMATH DE number 3512137 (Why is no real title available?)
- scientific article; zbMATH DE number 2081031 (Why is no real title available?)
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A fast hypergraph min-cut algorithm for circuit partitioning
- A generalization of Kónig's theorem
- A new approach to the maximum-flow problem
- A new approach to the minimum cut problem
- A simple min-cut algorithm
- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
- Approximation Algorithms for Submodular Multiway Partition
- Cutsets and partitions of hypergraphs
- Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Finding minimum 3-way cuts in hypergraphs
- Fully-dynamic min-cut
- Multiway cuts in node weighted graphs
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the complexity of constructing evolutionary trees
Cited in
(26)- A fast hypergraph min-cut algorithm for circuit partitioning
- Minimum cuts and sparsification in hypergraphs
- On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem
- On some algorithmic aspects of hypergraphic matroids
- Hypergraph \(k\)-cut in randomized polynomial time
- Finding Minimum 3-Way Cuts in Hypergraphs
- Counting the number of minimum cuts in undirected multigraphs
- Computing All Small Cuts in an Undirected Network
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- Global and fixed-terminal cuts in digraphs
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
- Finding minimum 3-way cuts in hypergraphs
- Computing minimum cuts in hypergraphs
- Computing minimum multiway cuts in hypergraphs from hypertree packings
- Computing the Map of Geometric Minimal Cuts
- A Heuristic Solution of a Cutting Problem Using Hypergraphs
- On minimal cuts of recursively generated hypergraphs
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
- scientific article; zbMATH DE number 3958752 (Why is no real title available?)
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- From graph to hypergraph multiway partition: is the single threshold the only route?
This page was built for publication: Computing minimum multiway cuts in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799394)
