Counting independent sets in unbalanced bipartite graphs

DOI10.1137/1.9781611975994.88OpenAlexW3001245651MaRDI QIDQ5146865

Sarah M. Cannon, Will Perkins

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (11)

An FPTAS for the hardcore model on random regular bipartite graphs ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Fast mixing via polymers for random graphs with unbounded degree ⋮ Efficient sampling and counting algorithms for the Potts model on ℤ^d at all temperatures ⋮ Approximately counting independent sets in bipartite graphs via graph containers ⋮ Homomorphisms from the torus ⋮ Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ Independent sets in the hypercube revisited ⋮ Algorithms for #BIS-Hard Problems on Expander Graphs ⋮ Unnamed Item ⋮ Polymer dynamics via cliques: new conditions for approximations

This page was built for publication: Counting independent sets in unbalanced bipartite graphs