Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Hi-index | 0.00 |
We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n / log d) hops.