A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Journal of Combinatorial Optimization

Volumn 4, Issue 2, 2000, Pages 151-169

  Nagamochi, Hiroshi ^a   Katayama, Shigeki ^b   Ibaraki, Toshihide ^c  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b TOSHIBA CORPORATION   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Graphs; k way cuts; Minimum cuts; Polynomial algorithm

Indexed keywords

EID: 0042685159     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009804919645     Document Type: Article

References (27)

1. M. Burlet and O. Goldschmidt, "A new and improved algorithm for the 3-cut problem," Operations Research Letters, vol. 21, pp. 225-227, 1997.
2. S. Even and R.E. Tarjan, "Network flow and testing graph connectivity," SIAM J. Computing, vol. 4, pp. 507-518, 1975.
3. A.V. Goldberg and S. Rao, "Beyond the flow decomposition barrier," in Proc. 38th IEEE Annual Symp. on Foundations of Computer Science, 1997, pp. 2-11.
4. A.V. Goldberg and R.E. Tarjan, "A new approach to the maximum flow problem," J. ACM, vol. 35, pp. 921-940, 1988.
5. O. Goldschmidt and D.S. Hochbaum, "A polynomial algorithm for the k-cut problem for fixed k," Mathematics of Operations Research, vol. 19, pp. 24-37, 1994.
6. H.W. Harnacher, J.-C. Picard, and M. Queyranne, "Ranking the cuts and cut-sets of a network," Annals of Discrete Applied Mathematics, vol. 19, pp. 183-200, 1984a.
7. H.W. Hamacher, J.-C. Picard, and M. Queyranne, "On finding the K best cuts in a network," Operations Research Letters, vol. 2, pp. 303-305, 1984b.
8. J. Hao and J. Orlin, "A faster algorithm for finding the minimum cut in a directed graph," J. Algorithms, vol. 17, pp. 424-446, 1994.
9. M.R. Henzinger, P. Klein, S. Rao, and D. Williamson, "Faster shortest-path algorithms for planar graphs," J. Comp. Syst. Sc., vol. 53, pp. 2-23, 1997.
10. 2) algorithm for the planar 3-cut problem," SIAM J. Algebraic Discrete Methods, vol. 6, pp. 707-712, 1985.
11. Y. Kamidoi, S. Wakabayashi, and N. Yoshida, "Faster algorithms for finding a minimum k-way cut in a weighted graph," in Proc. IEEE International Symposium on Circuits and Systems, 1997a, pp. 1009-1012.
12. Y. Kamidoi, S. Wakabayashi, and N. Yoshida, "A new approach to the minimum k-way partition problem for weighted graphs," Technical Report of Inst. Electron. Inform. Comm. Eng., COMP97-25, 1997b, pp. 25-32.
13. S. Kapoor, "On minimum 3-cuts and approximating k-cuts using cut trees," in Lecture Notes in Computer Science Vol. 1084, Springer-Verlag, 1996, pp. 132-146.
14. D.R. Karger, "Minimum cuts in near-linear time," in Proceedings 28th ACM Symposium on Theory of Computing, 1996, pp. 56-63.
15. 2) algorithm for minimum cuts," in Proceedings 25th ACM Symposium on Theory of Computing, 1993, pp. 757-765.
16. D.R. Karger and C. Stein, "A new approach to the minimum cut problems," J. ACM, vol. 43, no. 4, pp. 601-640, 1996.
17. A.V. Karzanov, "O nakhozhdenii maksimal' nogo potoka v setyakh spetsial' nogo vida i nekotorykh prilozheniyakh, in Mathematicheskie Voprosy Upravleniya Proizvodstvom, Vol. 5, Moscow State University Press: Moscow, 1973. In Russian; title translation: On Finding Maximum Flows in Networks with Special Structure and Some Applications.
18. N. Katoh, T. Ibaraki, and H. Mine, "An efficient algorithm for K shortest simple paths," Networks, vol. 12, pp. 441-427, 1982.
19. C.H. Lee, M. Kim, and C.I. Park, "An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems," in Proc. IEEE Int. Conf. on Computer-Aided Design, 1990, pp. 748-751.
20. T. Lengaur, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, 1990.
21. W. Mader, "Grad und lokaler Zusammenhang in unendliche Graphen," Math. Ann., vol. 205, pp. 9-11, 1973.
22. H. Nagamochi and T. Ibaraki, "A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph," Algorithmica, vol. 7, pp. 583-596, 1992a.
23. H. Nagamochi and T. Ibaraki, "Computing the edge-connectivity of multigraphs and capacitated graphs," SIAM J. Discrete Mathematics, vol. 5, pp. 54-66, 1992.
24. H. Nagamochi and T. Ibaraki, "A fast algorithm for computing minimum 3-way and 4-way cuts," in 7th Conference on Integer Programming and Combinatorial Optimization, June 9-11, Graz, Austria, 1999. Lecture Notes in Computer Science, Vol. 1610, Springer-Verlag, pp. 377-390.
25. H. Nagamochi and T. Ibaraki, "A fast algorithm for computing minimum 3-way and 4-way cuts," in 7th Conference on Integer Programming and Combinatorial Optimization, June 9-11, Graz, Austria, 1999. Lecture Notes in Computer Science, Vol. 1610, Springer-Verlag, pp. 377-390.
26. W. Pulleyblank, "Polyhedral combinatorics," in Mathematical Programming the State of the Art, A. Bachem et al. (Eds.), Springer-Verlag, 1983, pp. 312-345.
27. V.V. Vazirani and M. Yannakakis, "Suboptimal cuts: Their enumeration, weight, and number," in Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, 1992, pp. 366-377.