Login / Signup
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover.
Jirí Fiala
Petr A. Golovach
Jan Kratochvíl
Published in:
TAMC (2009)
Keyphrases
</>
vertex cover
parameterized complexity
approximation algorithms
fixed parameter tractable
bounded treewidth
search space
optimization problems
np complete
directed graph
computational problems