14 citations · 15 across the 2 of their papers we have counts for
3 papers
The fast intersection transform with applications to counting paths
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an -element set. In particular, the algorithm const…
Trimmed Moebius Inversion and Graphs of Bounded Degree
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius inver…
Computing the Tutte polynomial in vertex-exponential time
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials…