A divide-and-conquer approach to the minimum k-way cut problem

Algorithmica (New York)

Volumn 32, Issue 2, 2002, Pages 262-276

  Kamidoi, Y ^a   Wakabayashi, S ^b   Yoshida, N ^a  

^a HIROSHIMA CITY UNIVERSITY   (Japan)

^b HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Deterministic algorithm; Maximum flow computation; Minimunk way cut; Recursive structure; Undirected weighted graph

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; PROBLEM SOLVING;

RECURSIVE STRUCTURE;

GRAPH THEORY;

EID: 0141991952     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0070-2     Document Type: Article

References (15)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin: Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. M. Burlet and O. Goldschmidt: A new and improved algorithm for the 3-cut problem, Oper. Res. Lett., 21:225-227, 1997.
3. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis: The complexity of multiterminal cuts, SIAM J. Comput., 23(4): 864-894, 1994.
4. S. Even: Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
5. O. Goldschmidt and D. S. Hochbaum: Polynomial algorithm for the k-cut problem for fixed it. Math. Oper. Res., 19(1): 24-37, 1994.
6. R. Gomory and T. C. Hu: Multi-terminal network flows, J. SIAM, 9:551-570, 1961.
7. 2) algorithm for the planar 3-cut problem, SIAM J. Discrete Math., 6(4): 707-712, 1985.
8. Y. Kamidoi, S. Wakabayashi, and N. Yoshida: Faster algorithms for finding a minimum k-way cut in a weighted graph, Proc. 1997 IEEE Internat. Symp. on Circuits and Systems, Vol. 2, pp. 1009-1012, 1997.
9. S. Kapoor: On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees, Lecture Notes in Computer Science 1084, pp. 132-146, Springer-Verlag, Berlin, 1996.
10. 2) algorithm for minimum cuts, Proc. 25th Annual ACM Symp. on Theory of Computing, pp. 757-765, 1993.
11. H. Nagamochi and T. Ibaraki: Computing the edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Math., 5:54-66, 1992.
12. H. Nagamochi and T. Ibaraki: A fast algorithm for computing minimum 3-way and 4-way cuts, Proc. 7th Conf. on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 1610, pp. 377-390, Springer-Verlag, Berlin, 1999.
13. H. Nagamochi, K. Nishimura, and T. Ibaraki: Computing all small cuts in an undirected network, SIAM J. Discrete Math., 10(3): 469-481, 1997.
14. H. Saran and V. V. Vazirani: Finding k cuts within twice the optimal, SIAM J. Comput., 24(1): 101-108, 1995.
15. V. Vazirani and M. Yannakakis: Suboptimal Cuts: Their Enumeration, Weight, and Number, Lecture Notes in Computer Science 623, pp. 366-377, Springer-Verlag, Berlin, 1992.