论文信息 - A new and improved algorithm for the 3-cut problem

A new and improved algorithm for the 3-cut problem

We present a O(mn^3) time exact algorithm for finding a minimum 3-cut in an edge-weighted graph. This running time compares very favorably with the best-known algorithm which takes O(mn^5) time in the worst case.

Michel Burlet | Olivier Goldschmidt

[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2] Toshihide Ibaraki,et al. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[3] Dorit S. Hochbaum,et al. A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[4] Toshihide Ibaraki,et al. Computing All Small Cuts in Undirected Networks , 1994, ISAAC.