Login / Signup

On the Parameterized Complexity of Happy Vertex Coloring.

Akanksha Agrawal
Published in: IWOCA (2017)
Keyphrases
  • parameterized complexity
  • global constraints
  • fixed parameter tractable
  • symmetry breaking
  • database
  • undirected graph
  • search algorithm
  • np hard
  • phase transition
  • vertex set