Abstract
This paper presents algorithms for computing a minimum 3 -way cut and a minimum 4 -way cut of an undirected weighted graph G . Let G=(V, E) be an undirected graph with n vertices, m edges, and positive edge weights. Goldschmidt and Hochbaum presented an algorithm for the minimum k -way cut problem with fixed k , that requires O(n4) and O(n6) maximum flow computations, respectively, to compute a minimum 3 -way cut and a minimum 4 -way cut of G . In this paper we first show some properties on minimum 3 -way cuts and minimum 4 -way cuts, which indicate a recursive structure of the minimum k -way cut problem when k = 3 and 4 . Then, based on those properties, we give divide-and-conquer algorithms for computing a minimum 3 -way cut and a minimum 4 -way cut of G , which require O(n3) and O(n4) maximum flow computations, respectively.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kamidoi, Wakabayashi & Yoshida A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem . Algorithmica 32, 262–276 (2002). https://doi.org/10.1007/s00453-001-0070-2
Issue Date:
DOI: https://doi.org/10.1007/s00453-001-0070-2