Exact counting of Euler Tours for Graphs of Bounded Treewidth.
Prasad CheboluMary CryanRussell MartinPublished in: CoRR (2013)
Keyphrases
- bounded treewidth
- np complete
- monadic datalog
- conjunctive queries
- highly parallelizable
- decision problems
- model counting
- polynomial size
- relational learning
- traveling salesman problem
- databases
- boolean functions
- domain knowledge
- fixed parameter tractable
- bounded degree
- database systems
- query evaluation
- utility function
- knowledge representation
- graph theoretic
- query language
- lower bound
- information retrieval