11 citations · 24 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2010★ 10 cited
Exponential Time Complexity of Weighted Counting of Independent Sets
Christian Hoffmann
We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k.…
cs.CC2007
On the Complexity of the Interlace Polynomial
Markus Bläser, Christian Hoffmann
We consider the two-variable interlace polynomial introduced by Arratia, Bollobas and Sorkin (2004). We develop graph transformations which allow us to derive point-to-point reduct…