Distributed routing in small-world networks

DOI10.1137/1.9781611972863.14MaRDI QIDQ5233471zbMATH OpenOpenAlexFDO

Authors Oskar Sandberg

Publication date 11 September 2019

Published in 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972863.14

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational methods in Markov chains (60J22) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Optimal routing in a small-world network
• The small-world phenomenon: an algorithmic perspective
• Efficient routeing in Poisson small-world networks
• Could any graph be turned into a small-world?
• Analyzing Kleinberg's (and other) small-world models

Cited in

(8)

• Content search through comparisons
• Category-based routing in social networks: membership dimension and the small-world phenomenon
• scientific article; zbMATH DE number 1928607 (Why is no real title available?)
• scientific article; zbMATH DE number 1931809 (Why is no real title available?)
• scientific article; zbMATH DE number 2112462 (Why is no real title available?)
• Search in social networks using MCMC algorithm
• Navigation in real-world complex networks through embedding in latent spaces
• Abstract geometrical computation. IV: Small Turing universal signal machines

This page was built for publication: Distributed routing in small-world networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233471)