89 citations · 138 across the 17 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010★ 9 cited
The Exponential Time Complexity of Computing the Probability That a Graph is Connected
Thore Husfeldt, Nina Taslaman
We show that for every probability p with 0 < p < 1, computation of all-terminal graph reliability with edge failure probability p requires time exponential in Omega(m/ log^2 m) fo…
cs.DS2010
Narrow sieves for parameterized paths and packings
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem.…