Weighted Counting of Matchings in Unbounded-Treewidth Graph Families

  title={Weighted Counting of Matchings in Unbounded-Treewidth Graph Families},
  author={Antoine Amarilli and Mika{\"e}l Monet},
We consider a weighted counting problem on matchings, denoted PrMatching p G q , on an arbitrary fixed graph family G . The input consists of a graph G P G and of rational probabilities of existence on every edge of G , assuming independence. The output is the probability of obtaining a matching of G in the resulting distribution, i.e., a set of edges that are pairwise disjoint. It is known that, if G has bounded treewidth , then PrMatching p G q can be solved in polynomial time. In this paper… 

Figures from this paper

Easy Problems for Tree-Decomposable Graphs

The Complexity of Counting in Sparse, Regular, and Planar Graphs

It is proved that the problems of counting matchings, vertex covers, independent sets, and extremal variants of these all remain hard when restricted to planar bipartite graphs of bounded degree or regular graphs of constant degree.

Polynomial bounds for the grid-minor theorem

The first polynomial relationship between treewidth and grid-minor size is obtained by showing that f(k) = Ω(kδ) for some fixed constant δ > 0, and an algorithm is described that finds a model of such a grid-Minor in G.

Lower Bounds for the Complexity of Monadic Second-Order Logic

It is shown that if C is any class of graphs which is closed under taking sub-graphs and whose tree-width is not bounded by a poly-logarithmic function, then MSO_2-model checking is intractable on C (under a suitable assumption from complexity theory).

Tractable Lineages on Treelike Instances: Limits and Extensions

Bounded-treewidth tractability explains the tractability of the inversion-free safe queries: one can rewrite their input instances to have bounded-Treewidth, and the previous dichotomy to lineages is strengthened.

Symmetric Weighted First-Order Model Counting

This paper proves that all γ-acyclic queries have polynomial time data complexity, and proves that, for every fragment FOk, k ≥ 2, the combined complexity of FOMC (or WFOMC) is #P-complete.

Connecting Knowledge Compilation Classes Width Parameters

It is shown that pathwidth and treewidth respectively characterize the efficiency of compiling monotone DNFs to uOBDDs and d-SDNNFs with compilation being singly exponential in the corresponding width parameter.

Connecting Width and Structure in Knowledge Compilation

For the language of DNF and CNF, pathwidth and treewidth respectively characterize the efficiency of compiling to OBDDs and (d-)SDNNFs, that is, compilation is singly exponential in the width parameter.