Efficient routing in networks with long range contacts
From MaRDI portal
Recommendations
- Tight lower bounds for greedy routing in uniform small world rings
- Almost optimal decentralized routing in long-range contact networks
- Close to optimal decentralized routing in long-range contact networks
- Tight lower bounds for greedy routing in higher-dimensional small-world grids
- On the complexity of greedy routing in ring-based peer-to-peer networks
Cited in
(21)- Universal augmentation schemes for network navigability
- Estimating network size from local information
- Navigable small-world networks with few random bits
- Navigation in spatial networks: a survey
- Kleinberg's grid unchained
- Greedy routing in small-world networks with power-law degrees
- D2B: A de Bruijn based content-addressable network
- Could any graph be turned into a small-world?
- Eclecticism shrinks even small worlds
- Orientation in social networks
- Optimal routing in a small-world network
- Close to optimal decentralized routing in long-range contact networks
- Recovering the Long-Range Links in Augmented Graphs
- Graph Embedding through Random Walk for Shortest Paths Problems
- Tight lower bounds for greedy routing in uniform small world rings
- Tight lower bounds for greedy routing in higher-dimensional small-world grids
- Depth of Field and Cautious-Greedy Routing in Social Networks
- Almost optimal decentralized routing in long-range contact networks
- Asymptotically optimal solutions for small world graphs
- Neighbor selection and hitting probability in small-world graphs
- Recovering the long-range links in augmented graphs
This page was built for publication: Efficient routing in networks with long range contacts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436057)
