Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems

Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond. Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electronic Notes in Theoretical Computer Science, 78:209-222, 2003. [doi]

Abstract

Abstract is missing.