On the parameterized complexity of non-hereditary relaxations of clique.

Ambroise Baril Antoine Castillon Nacim Oijid

Published in: Theor. Comput. Sci. (2024)

Keyphrases

parameterized complexity
fixed parameter tractable
np hard
global constraints
lower bound
linear programming
symmetry breaking
databases
np complete
bounded treewidth