Colouring Reconfiguration Is Fixed-Parameter Tractable.

Matthew Johnson Dieter Kratsch Stefan Kratsch Viresh Patel Daniël Paulusma

Published in: CoRR (2014)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np hard
np complete
global constraints
bounded treewidth
conjunctive queries
abstract argumentation
vertex set
special case
lower bound
constraint satisfaction problems
decision problems
constraint programming