Optimal path search in small worlds

DOI10.1145/1993636.1993689zbMath1288.05254OpenAlexW2007101431MaRDI QIDQ5419109

Nicolas Schabanel, George Giakkoupis

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993636.1993689

zbMATH Keywords

social networkspeer-to-peer networksoptimal pathssmall worldsdecentralized search

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items (2)

Greedy routing in small-world networks with power-law degrees ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network

This page was built for publication: Optimal path search in small worlds