Login / Signup
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-Rodriguez
Frances A. Rosamond
Published in:
Electron. Notes Theor. Comput. Sci. (2003)
Keyphrases
</>
related problems
parameterized complexity
fixed parameter tractable
global constraints
relational databases
computational problems
symmetry breaking
databases
database systems
computational complexity
np hard