Parameterized Complexity of Length-bounded Cuts and Multicuts.

Pavel Dvorák Dusan Knop

Published in: Algorithmica (2018)

Keyphrases

parameterized complexity
fixed parameter tractable
bounded treewidth
computational problems
global constraints
np complete
np hard
search algorithm
information extraction
xml documents
special case
symmetry breaking