Parameterized complexity of coloring problems: Treewidth versus vertex cover.

Jirí Fiala Petr A. Golovach Jan Kratochvíl

Published in: Theor. Comput. Sci. (2011)

Keyphrases

vertex cover
parameterized complexity
approximation algorithms
np complete
combinatorial problems
linear programming
exact algorithms
fixed parameter tractable