Eclecticism shrinks even small worlds

DOI10.1007/s00446-005-0137-4zbMath1264.05127OpenAlexW2683405002MaRDI QIDQ2375296

Cyril Gavoille, Pierre Fraigniaud, Christophe Paul

Publication date: 13 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.5656

zbMATH Keywords

small world graphsindirect-greedy routingMilgram's experiment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Kleinberg's grid unchained ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Navigable small-world networks with few random bits

Cites Work

• Unnamed Item
• The diameter of a long-range percolation graph
• The small-world phenomenon
• Know thy neighbor's neighbor
• Fault-tolerant routing in peer-to-peer systems
• Collective dynamics of ‘small-world’ networks
• Automata, Languages and Programming
• Analyzing Kleinberg's (and other) small-world Models

This page was built for publication: Eclecticism shrinks even small worlds