Interval Completion Is Fixed Parameter Tractable.

Yngve Villanger Pinar Heggernes Christophe Paul Jan Arne Telle

Published in: SIAM J. Comput. (2009)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np hard
global constraints
conjunctive queries
np complete
bounded treewidth
vertex set
abstract argumentation
databases
computational complexity
lower bound