Weighted Counting of Matchings in Unbounded-Treewidth Graph Families

preprint2023arXivOpen access

Abstract

We consider a weighted counting problem on matchings, denoted PrMatching(G)\textrm{PrMatching}(\mathcal{G}), on an arbitrary fixed graph family G\mathcal{G}. The input consists of a graph G∈GG\in \mathcal{G} and of rational probabilities of existence on every edge of GG, assuming independence. The output is the probability of obtaining a matching of GG in the resulting distribution, i.e., a set of edges that are pairwise disjoint. It is known that, if G\mathcal{G} has bounded treewidth, then PrMatching(G)\textrm{PrMatching}(\mathcal{G}) can be solved in polynomial time. In this paper we show that, under some assumptions, bounded treewidth in fact characterizes the tractable graph families for this problem. More precisely, we show intractability for all graph families G\mathcal{G} satisfying the following treewidth-constructibility requirement: given an integer kk in unary, we can construct in polynomial time a graph G∈GG \in \mathcal{G} with treewidth at least kk. Our hardness result is then the following: for any treewidth-constructible graph family G\mathcal{G}, the problem PrMatching(G)\textrm{PrMatching}(\mathcal{G}) is intractable. This generalizes known hardness results for weighted matching counting under some restrictions that do not bound treewidth, e.g., being planar, 3-regular, or bipartite; it also answers a question left open in Amarilli, Bourhis and Senellart (PODS'16). We also obtain a similar lower bound for the weighted counting of edge covers.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.