Counting Euler Tours in Undirected Bounded Treewidth Graphs.

Nikhil Balaji Samir Datta Venkatesh Ganesan

Published in: CoRR (2015)

Keyphrases

bounded treewidth
np complete
monadic datalog
decision problems
conjunctive queries
highly parallelizable
boolean functions
directed graph
model counting
relational learning
weighted graph
polynomial size
np hard
traveling salesman problem
undirected graph
databases
domain knowledge
knowledge base