Cutting Up is Hard to Do: the Parameterized Complexity of k-cut and Related Problems.
No Thumbnail Available
File version
Author(s)
Downey, RG
Estivill-Castro, V
Fellows, M
Prieto, E
Rosamund, FA
Estivill-Castro, V
Fellows, M
Prieto, E
Rosamund, FA
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
J. Harland
Date
2003
Size
File type(s)
Location
Adelaide, Australia
License
Journal Title
Conference Title
Electronic Notes in Theoretical Computer Science
Book Title
Edition
Volume
78
Issue
Thesis Type
Degree Program
School
Publisher link
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Theory of computation
Cognitive and computational psychology