Finding topological subgraphs is fixed-parameter tractable.

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

Published in: STOC (2011)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np hard
data sources
np complete
query answering
global constraints