Computing minimum multiway cuts in hypergraphs from hypertree packings

DOI10.1007/978-3-642-13036-6_2MaRDI QIDQ3569805zbMATH OpenOpenAlexFDO

Authors Takuro Fukunaga

Publication date 22 June 2010

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13036-6_2

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27)

Recommendations

• Computing minimum multiway cuts in hypergraphs
• Finding minimum 3-way cuts in hypergraphs
• Minimum cut and minimum k-cut in hypergraphs via branching contractions
• Computing minimum cuts in hypergraphs
• scientific article; zbMATH DE number 6850403

Cited in

(11)

• An exact algorithm for min-max hyperstructure equipartition with a connected constraint
• Computing minimum multiway cuts in hypergraphs
• Hypergraph \(k\)-cut in randomized polynomial time
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
• Submodular Cost Allocation Problem and Applications
• Finding Minimum 3-Way Cuts in Hypergraphs
• Minimum cuts and sparsification in hypergraphs
• Computing minimum cuts in hypergraphs
• scientific article; zbMATH DE number 7559431 (Why is no real title available?)
• Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
• Finding minimum 3-way cuts in hypergraphs

This page was built for publication: Computing minimum multiway cuts in hypergraphs from hypertree packings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569805)