Counting independent sets in graphs with bounded bipartite pathwidth

DOI10.1007/978-3-030-30786-8_23OpenAlexW2975888281MaRDI QIDQ2301551

Haiko Müller, Catherine Greenhill, Martin Dyer

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1812.03195

zbMATH Keywords

independent setpathwidthMarkov chain Monte Carlo algorithmfully polynomial-time randomized approximation scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Mixing of Markov chains for independent sets on chordal graphs with bounded separators ⋮ Counting independent sets in graphs with bounded bipartite pathwidth ⋮ Counting Weighted Independent Sets beyond the Permanent

This page was built for publication: Counting independent sets in graphs with bounded bipartite pathwidth