Finding Minimum 3-Way Cuts in Hypergraphs

DOI10.1007/978-3-540-79228-4_24zbMath1139.05344OpenAlexW2120502293MaRDI QIDQ3502653

Mingyu Xiao

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Finding minimum 3-way cuts in hypergraphs

This page was built for publication: Finding Minimum 3-Way Cuts in Hypergraphs