Depth of Field and Cautious-Greedy Routing in Social Networks
From MaRDI portal
Publication:5387792
DOI10.1007/978-3-540-77120-3_50zbMath1193.68044OpenAlexW1485666733MaRDI QIDQ5387792
David Barbella, Ben Sowell, George Kachergis, Anna Sallstrom, David Liben-Nowell
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_50
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Could any graph be turned into a small-world?
- The small-world phenomenon
- Know thy neighbor's neighbor
- Distance estimation and object location via rings of neighbors
- A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
- Navigating Low-Dimensional and Hierarchical Population Networks
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Eclecticism shrinks even small worlds
- Analyzing Kleinberg's (and other) small-world Models
- Local embeddings of metric spaces
This page was built for publication: Depth of Field and Cautious-Greedy Routing in Social Networks