On the Parameterized Complexity of the Maximum Edge Coloring Problem.

Prachi Goyal Vikram Kamat Neeldhara Misra

Published in: CoRR (2013)

Keyphrases

parameterized complexity
global constraints
undirected graph
fixed parameter tractable
weighted graph
symmetry breaking
computational complexity
search algorithm
data management