Greedy Routing and the Algorithmic Small-World Phenomenon

DOI10.1145/3087801.3087829zbMath1380.68024OpenAlexW2561489119MaRDI QIDQ5368989

Karl Bringmann, Yannic Maus, Johannes Lengler, Anisur Rahaman Molla, Ralph Keusch

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

greedy routingrouting protocolssmall-world phenomenonrandom graph modelsreal-world networksinternet routingMilgram experiment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Network protocols (68M12) Internet topics (68M11)

Related Items (9)

Graph distances in scale-free percolation: the logarithmic case ⋮ Unnamed Item ⋮ Geometric inhomogeneous random graphs ⋮ The idemetric property: when most distances are (almost) the same ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time

This page was built for publication: Greedy Routing and the Algorithmic Small-World Phenomenon