Approximately counting independent sets in bipartite graphs via graph containers

Matthew Jenssen, Will Perkins 0001, Aditya Potukuchi. Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms, 63(1):215-241, August 2023. [doi]

@article{JenssenPP23,
  title = {Approximately counting independent sets in bipartite graphs via graph containers},
  author = {Matthew Jenssen and Will Perkins 0001 and Aditya Potukuchi},
  year = {2023},
  month = {August},
  doi = {10.1002/rsa.21145},
  url = {https://doi.org/10.1002/rsa.21145},
  researchr = {https://researchr.org/publication/JenssenPP23},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {63},
  number = {1},
  pages = {215-241},
}