2 citations · 3 across the 8 of their papers we have counts for
1 paper · 2 filters
Marc Heinrich, Haiko Müller
We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem whe…