Closest 4-leaf power is fixed-parameter tractable.

Michael Dom Jiong Guo Falk Hüffner Rolf Niedermeier

Published in: Discret. Appl. Math. (2008)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np complete
np hard
global constraints
abstract argumentation
database systems