37 citations · 121 across the 18 of their papers we have counts for
1 paper · 2 filters
Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič +1
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of ev…