Chordal Editing is Fixed-Parameter Tractable.

Yixin Cao Dániel Marx

Published in: STACS (2014)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np hard
np complete
global constraints
bounded treewidth
conjunctive queries
abstract argumentation
vertex set
constraint satisfaction problems
approximation algorithms
undirected graph
database systems
lower bound