Counting independent sets in unbalanced bipartite graphs
From MaRDI portal
Publication:5146865
DOI10.1137/1.9781611975994.88MaRDI QIDQ5146865
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
68Wxx: Algorithms in computer science
Related Items
Unnamed Item, Independent sets in the hypercube revisited, 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, Polymer dynamics via cliques: new conditions for approximations, 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, Algorithms for #BIS-Hard Problems on Expander Graphs