Papillon: greedy routing in rings
2005
We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n / log d) hops.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
31
References
8
Citations
NaN
KQI