• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover.

Jirí FialaPetr A. GolovachJan 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