A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 164-173

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

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS;

DETERMINISTIC ALGORITHMS; EDGE-WEIGHTED GRAPH; K-WAY CUTS; MAXIMUM FLOWS; TIME BOUND; VERTEX SET;

GRAPH THEORY;

EID: 80052921977     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_16     Document Type: Conference Paper

References (19)

1. M. Burlet and O. Goldschmidt, A new and improved algorithm for the 3-cut problem, Operations Research Letters, vol.21, (1997), pp. 225-227.
2. S. Even and R. E. Tarjan, Network flow and testing graph connectivity, SIAM J. Computing, vol.4, (1975), pp. 507-518.
3. A. V. Goldberg and S. Rao, Beyond the flow decomposition barrier, 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, (1988), pp. 921-940.
5. O. Goldschmidt and D. S. Hochbaum, A polynomial algorithm for the k-cut problem for fixed k, Mathematics of Operations Research, vol.19, (1994), pp. 24-37.
6. J. Hao and J. Orlin, A faster algorithm for finding the minimum cut in a directed graph, J. Algorithms, vol. 17, (1994), pp. 424-446.
7. M. R. Henzinger, P. Klein, S. Rao and D. Williamson, Faster shortest-path algorithms for planar graphs, J. Comp. Syst. Sc., vol. 53, (1997), pp. 2-23.
8. 2) algorithm for the planar 3-cut problem, SIAM J. Algebraic Discrete Methods, vol.6, (1985), pp. 707-712.
9. Y. Kamidoi, S. Wakabayashi and N. Yoshida, Faster algorithms for finding a mini- mum k-way cut in a weighted graph, Proc. IEEE International Symposium on Circuits and Systems, (1997), pp. 1009-1012.
10. 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, (1997), pp. 25-32.
11. S. Kapoor, On minimum 3-cuts and approximating k-cuts using cut trees, Lecture Notes in Computer Science 1084, Springer-Verlag, (1996), pp. 132-146.
12. D. R. Karger, Minimum cuts in near-linear time, Proceedings 28th ACM Symposium on Theory of Computing, (1996), pp. 56-63.
13. D. R. Karger and C. Stein, An Õ (n2) algorithm for minimum cuts, Proceedings 25th ACM Symposium on Theory of Computing, (1993), pp. 757-765.
14. D. R. Karger and C. Stein, A new approach to the minimum cut problems, J. ACM, vol.43, no.4, (1996), pp. 601-640.
15. A. V. Karzanov, O nakhozhdenii maksimal'nogo potoka v setyakh spetsial'nogo vida i nekotorykh prilozheniyakh, In Mathematicheskie Voprosy Upravleniya Proizvodstvom, volume 5, Moscow State University Press, Moscow, (1973). In Russian; title translation: On finding maximum flows in networks with special structure and some applications.
16. N. Katoh, T. Ibaraki and H. Mine, An efficient algorithm for K shortest simple paths, Networks, vol.12, (1982), pp. 441-427.
17. H. Nagamochi and T. Ibaraki, Computing the edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, vol.5, (1992), pp. 54-66.
18. H. Nagamochi and T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, Lecture Notes in Computer Science, Springer-Verlag, 7th Conference on Integer Programming and Combinatorial Optimization, June 9-11, Graz, Austria, (1999) (to appear).
19. V. V. Vazirani and M. Yannakakis, Suboptimal cuts: Their enumeration, weight, and number, Lecture Notes in Computer Science, 623, Springer-Verlag, (1992), pp. 366-377.