92 citations · 310 across the 34 of their papers we have counts for
5 papers · 1 filter
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-…
An Enumeration of Graphical Designs
Yeow Meng Chee, Petteri Kaski
Let denote the set of pairs for which there exists a graphical - design. Most results on graphical designs have gone to show the finiteness of …
Circumspect descent prevails in solving random constraint satisfaction problems
Mikko Alava, John Ardelius, Erik Aurell +4
We study the performance of stochastic local search algorithms for random instances of the -satisfiability (-SAT) problem. We introduce a new stochastic local search algorith…
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…