On the parameterized complexity of the acyclic matching problem.

Sahab Hajebi Ramin Javadi

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

Keyphrases

parameterized complexity
np hard
np complete
fixed parameter tractable
lower bound
global constraints
special case
background knowledge