An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts

DOI10.1007/978-3-540-92182-0_21zbMath1183.05086OpenAlexW1549414783MaRDI QIDQ3596719

Mingyu Xiao

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_21

zbMATH Keywords

graph algorithmdivide-and-conquer\(k\)-way cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (6)

Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions ⋮ Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ Simple and improved parameterized algorithms for multiterminal cuts ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Finding minimum 3-way cuts in hypergraphs

This page was built for publication: An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts