124 citations · 275 across the 42 of their papers we have counts for
1 paper · 1 filter
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…