Login / Signup
The minimum spanning strong subdigraph problem is fixed parameter tractable.
Jørgen Bang-Jensen
Anders Yeo
Published in:
Discret. Appl. Math. (2008)
Keyphrases
</>
fixed parameter tractable
parameterized complexity
computational problems
np hard
global constraints
knowledge representation
np complete
bounded treewidth
search space
dynamic programming
information extraction
conjunctive queries