Finding topological subgraphs is fixed-parameter tractable

Martin Grohe Ken-ichi Kawarabayashi Dániel Marx Paul Wollan

Published in: CoRR (2010)

Keyphrases

parameterized complexity
fixed parameter tractable
databases
np hard
objective function
lower bound
data model
query language
information extraction
computational problems