Finding minimum 3-way cuts in hypergraphs
From MaRDI portal
Publication:765477
DOI10.1016/J.IPL.2010.05.003zbMATH Open1233.05192OpenAlexW1981202693MaRDI QIDQ765477FDOQ765477
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.003
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Connectivity (05C40) Hypergraphs (05C65)
Cites Work
- A new approach to the maximum-flow problem
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Multi-Terminal Network Flows
- On minimum 3-cuts and approximating k-cuts using Cut Trees
- A new approach to the minimum cut problem
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A simple min-cut algorithm
- A new and improved algorithm for the 3-cut problem
- A fast algorithm for computing minimum 3-way and 4-way cuts
- Title not available (Why is that?)
- A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
- Title not available (Why is that?)
- A fast hypergraph min-cut algorithm for circuit partitioning
- Finding Minimum 3-Way Cuts in Hypergraphs
- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- Cutsets and partitions of hypergraphs
- A divide-and-conquer approach to the minimum \(k\)-way cut problem.
Cited In (13)
- Finding Minimum 3-Way Cuts in Hypergraphs
- Hypergraph \(k\)-cut in randomized polynomial time
- 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\)
- Global and fixed-terminal cuts in digraphs
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Minimum Cuts and Sparsification in Hypergraphs
- Modeling hypergraphs by graphs with the same mincut properties
- Computing minimum multiway cuts in hypergraphs
- Submodular Cost Allocation Problem and Applications
- Title not available (Why is that?)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
This page was built for publication: Finding minimum 3-way cuts in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765477)
