41 citations · 108 across the 18 of their papers we have counts for
1 paper · 2 filters
David Aldous
We revisit an old minor topic in algorithms, the deterministic walk on a finite graph which always moves toward the nearest unvisited vertex until every vertex is visited. There is…