Fast computation of interlace polynomials on graphs of bounded treewidth

Markus Bläser Christian Hoffmann

Published in: CoRR (2009)

Keyphrases

bounded treewidth
np complete
decision problems
highly parallelizable
boolean functions
conjunctive queries
tractable cases
graph theory
relational learning
fixed parameter tractable
np hard
databases
optimal solution
probability distribution
graph theoretic
random graphs