Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time

Philip N. Klein, Dániel Marx. Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, editors, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Volume 7391 of Lecture Notes in Computer Science, pages 569-580, Springer, 2012. [doi]

Abstract

Abstract is missing.