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

Author(s)
Downey, RG
Estivill-Castro, V
Fellows, M
Prieto, E
Rosamund, FA
Griffith University Author(s)
Year published
2003
Metadata
Show full item record
Conference Title
Electronic Notes in Theoretical Computer Science
Volume
78
Subject
Theory of computation
Cognitive and computational psychology
Publication URI
Collection