Login / Signup

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.

Prachi GoyalVikram KamatNeeldhara Misra
Published in: MFCS (2013)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • undirected graph
  • global constraints
  • weighted graph
  • incomplete information
  • vertex set
  • relational databases
  • xml documents
  • np hard
  • partial order