Pages that link to "Item:Q2368969"
From MaRDI portal
The following pages link to Could any graph be turned into a small-world? (Q2368969):
Displayed 8 items.
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← 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)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- Depth of Field and Cautious-Greedy Routing in Social Networks (Q5387792) (← links)
- Delay of Social Search on Small-World Graphs (Q5411871) (← links)