Counting and Enumeration Problems with Bounded Treewidth

DOI10.1007/978-3-642-17511-4_22MaRDI QIDQ3066110zbMATH OpenOpenAlexFDO

Authors Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Publication date 7 January 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17511-4_22

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fast Counting with Bounded Treewidth
• Treewidth computation and extremal combinatorics
• Treewidth Computation and Extremal Combinatorics
• Bounded Tree-Width and CSP-Related Problems
• scientific article; zbMATH DE number 4006294
• Enumeration problems of trees
• Treewidth and counting projected answer sets
• Counting bounded tree depth homomorphisms
• Counting problems in parameterized complexity
• The complexity of approximately counting tree homomorphisms

Cited in

(10)

• Structural tractability of enumerating CSP solutions
• Counting truth assignments of formulas of bounded tree-width or clique-width
• Solving projected model counting by utilizing treewidth and its limits
• Monadic Datalog over finite structures of bounded treewidth
• Listing subgraphs by Cartesian decomposition
• Fast Counting with Bounded Treewidth
• Default logic and bounded treewidth
• Exploiting Database Management Systems and Treewidth for Counting
• Counting and coding identity trees with fixed diameter and bounded degree
• The challenges of unbounded treewidth in parameterised subgraph counting problems

This page was built for publication: Counting and Enumeration Problems with Bounded Treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066110)