Greedy routing steps S_n in the sequentially grown 1D graph equals the number of left-to-right and right-to-left minima in the insertion permutation minus 2, hence Theta(log n) whp.
Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
Greedy routing steps S_n in the sequentially grown 1D graph equals the number of left-to-right and right-to-left minima in the insertion permutation minus 2, hence Theta(log n) whp.