Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth

In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple algorithms for counting and uniformly sampling valid labelings of graphs, assuming a path decomposition is given. Thus, we show that several well-studied counting and sampling problems are fixed parameter tractable (FPT) when parameterized by the pathwidth of the input graph. We discuss connections to counting and sampling problems for distributive lattices and, in particular, we give a new FPT algorithm for exactly counting and uniformly sampling stable matchings.

[1]  Martin E. Dyer,et al.  On the relative complexity of approximate counting problems , 2000, APPROX.

[2]  Dan Gusfield,et al.  Three Fast Algorithms for Four Problems in Stable Marriage , 1987, SIAM J. Comput..

[3]  Bettina Speckmann,et al.  Area-universal rectangular layouts , 2009, SCG '09.

[4]  G. Birkhoff.  Rings of sets , 1937 .

[5]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..

[6]  Will Rosenbaum,et al.  Stable Matchings with Restricted Preferences: Structure and Complexity , 2020, ArXiv.

[7]  Anna R. Karlin,et al.  A simply exponential upper bound on the maximum number of stable matchings , 2017, STOC.

[8]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[9]  Robert W. Irving,et al.  The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..

[10]  Radu Curticapean,et al.  Counting Problems in Parameterized Complexity , 2018, IPEC.

[11]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[12]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[13]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[14]  Samir Khuller,et al.  The Lattice Structure of Flow in Planar Graphs , 1993, SIAM J. Discret. Math..

[15]  Dana Randall,et al.  Sampling stable marriages: why spouse-swapping won't work , 2008, SODA '08.

[16]  James Gary Propp.  Generating random elements of finite distributive lattices , 1997, Electron. J. Comb..

[17]  Martin E. Dyer,et al.  The Relative Complexity of Approximate Counting Problems , 2000, Algorithmica.