14 citations · 39 across the 4 of their papers we have counts for
4 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…
There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of
Petteri Kaski, Patric R. J. Östergård
We establish by means of a computer search that a complete graph on 14 vertices has 98,758,655,816,833,727,741,338,583,040 distinct and 1,132,835,421,602,062,347 nonisomorphic one-…
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…
Approximating max-min linear programs with local algorithms
Patrik Floréen, Petteri Kaski, Topi Musto +1
A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood…