9 citations · 11 across the 4 of their papers we have counts for
1 paper · 1 filter
Andreas Björklund
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O∗(1.657n) time. To the best of our knowledge, this is the first s…