3 citations · 4 across the 2 of their papers we have counts for
1 paper · 1 filter
Konstanty Junosza-Szaniawski, Michal Tuczynski
In this paper we give an algorithm for counting the number of all independent sets in a given graph which works in time O∗(1.1394n) for subcubic graphs and in time $O^*(1.2369^…