Counting Euler Tours in Undirected Bounded Treewidth Graphs.

Nikhil Balaji Samir Datta Venkatesh Ganesan

Published in: FSTTCS (2015)

Keyphrases

bounded treewidth
np complete
monadic datalog
decision problems
boolean functions
highly parallelizable
directed graph
conjunctive queries
weighted graph
model counting
relational databases
polynomial size
constraint satisfaction problems
fixed parameter tractable
learning algorithm