Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation

DOI10.1007/978-3-540-75520-3_2zbMath1151.68317OpenAlexW1502087588MaRDI QIDQ3527195

Pierre Fraigniaud

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_2

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)

Related Items (4)

How to use spanning trees to navigate in graphs ⋮ How to Use Spanning Trees to Navigate in Graphs ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network

This page was built for publication: Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation