Asymptotically optimal solutions for small world graphs

DOI10.1007/S00224-007-9073-YzbMath1140.68052OpenAlexW1964442613MaRDI QIDQ927399

Alfredo Navarra, Stéphane Pérennes, Michele Flammini, Luca Moscardelli

Publication date: 6 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9073-y

zbMATH Keywords

Social networksOblivious diameterSmall world graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14)

Related Items (1)

Navigable small-world networks with few random bits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The small-world phenomenon
• Fault-tolerant routing in peer-to-peer systems
• Algorithms – ESA 2005
• Eclecticism shrinks even small worlds
• Analyzing Kleinberg's (and other) small-world Models

This page was built for publication: Asymptotically optimal solutions for small world graphs