The Parameterized Complexity of the Rainbow Subgraph Problem.

Falk Hüffner Christian Komusiewicz Rolf Niedermeier Martin Rötzschke

Published in: WG (2014)

Keyphrases

parameterized complexity
fixed parameter tractable
np hard
global constraints
database
search space
symmetry breaking
np complete
constraint programming
desirable properties
computational problems