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...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 63; číslo 1; s. 215 - 241
Hlavní autori:	Jenssen, Matthew, Perkins, Will, Potukuchi, Aditya
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.08.2023 Wiley Subscription Services, Inc
Predmet:	Algorithms approximate counting Approximation Codes Containers Fugacity graph containers Graph theory Graphs independent sets Partitions (mathematics)
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!