The following pages link to Know thy neighbor's neighbor (Q3580959):
Displaying 20 items.
- \(D^2\)-tree: a new overlay with deterministic bounds (Q494810) (← links)
- Degree-optimal routing for P2P systems (Q841622) (← links)
- Neighbor selection and hitting probability in small-world graphs (Q957518) (← links)
- Recovering the long-range links in augmented graphs (Q962166) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Navigable small-world networks with few random bits (Q1034617) (← links)
- Navigation in spatial networks: a survey (Q1782452) (← links)
- The forgiving graph: a distributed data structure for low stretch under adversarial attack (Q1938375) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- Greedy routing and the algorithmic small-world phenomenon (Q2071825) (← links)
- Kleinberg's grid unchained (Q2182646) (← links)
- Greedy routing in small-world networks with power-law degrees (Q2256946) (← links)
- D2B: A de Bruijn based content-addressable network (Q2368967) (← links)
- Could any graph be turned into a small-world? (Q2368969) (← links)
- Eclecticism shrinks even small worlds (Q2375296) (← links)
- The expansion and mixing time of skip graphs with applications (Q2377266) (← links)
- Optimal routing in a small-world network (Q2508396) (← links)
- Close to optimal decentralized routing in long-range contact networks (Q2581272) (← links)
- A model of self‐avoiding random walks for searching complex networks (Q4648693) (← links)
- Routing complexity of faulty networks (Q5177243) (← links)
