Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

DOI10.1007/978-3-642-10631-6_8zbMath1272.68337OpenAlexW40005982MaRDI QIDQ3652191

Hiroshi Nagamochi, Takuro Fukunaga, Kazumasa Okumoto

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Submodular Cost Allocation Problem and Applications ⋮ Finding minimum 3-way cuts in hypergraphs

This page was built for publication: Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems