The effect of power-law degrees on the navigability of small worlds
From MaRDI portal
Publication:5170321
DOI10.1145/1582716.1582755zbMath1291.05190OpenAlexW2084442192MaRDI QIDQ5170321
Pierre Fraigniaud, George Giakkoupis
Publication date: 23 July 2014
Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1582716.1582755
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
The small-community phenomenon in networks ⋮ Greedy routing in small-world networks with power-law degrees ⋮ The Routing of Complex Contagion in Kleinberg’s Small-World Networks ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
This page was built for publication: The effect of power-law degrees on the navigability of small worlds