8 citations · 11 across the 4 of their papers we have counts for
1 paper · 1 filter
Artur Czumaj, Oded Goldreich, Dana Ron +3
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k≥3 and tree-minors in bounded-degree graphs. The complexity of these algorithm…