Approximately counting independent sets in bipartite graphs via graph containers

By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to d$$ d $$‐regular, bipartite graphs satisfying a weak expansion condition: when d$$ d $$ is co...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 63; no. 1; pp. 215 - 241
Main Authors:	Jenssen, Matthew, Perkins, Will, Potukuchi, Aditya
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.08.2023 Wiley Subscription Services, Inc
Subjects:	Algorithms approximate counting Approximation Codes Containers Fugacity graph containers Graph theory Graphs independent sets Partitions (mathematics)
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!