An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts

Mingyu Xiao. An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. In Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga, editors, Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Volume 5369 of Lecture Notes in Computer Science, pages 208-219, Springer, 2008. [doi]

Abstract

Abstract is missing.