Hitting Long Directed Cycles is Fixed-Parameter Tractable.

Alexander Göke Dániel Marx Matthias Mnich

Published in: CoRR (2020)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np hard
global constraints
np complete
databases
search algorithm
lower bound
bounded treewidth