Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.

Markus Bläser Christian Hoffmann

Published in: ESA (2009)

Keyphrases

bounded treewidth
np complete
decision problems
conjunctive queries
graph theoretic
highly parallelizable
np hard
reinforcement learning
graph theory
databases
relational databases
domain knowledge
knowledge representation
fixed parameter tractable