Eclecticism shrinks even small worlds
DOI10.1007/S00446-005-0137-4zbMATH Open1264.05127OpenAlexW2683405002MaRDI QIDQ2375296FDOQ2375296
Authors: Pierre Fraigniaud, Cyril Gavoille, 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
Recommendations
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10)
Cites Work
- Collective dynamics of `small-world' networks
- The small-world phenomenon: an algorithmic perspective
- The diameter of a long-range percolation graph
- Analyzing Kleinberg's (and other) small-world models
- Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
- Title not available (Why is that?)
- Fault-tolerant routing in peer-to-peer systems
- Automata, Languages and Programming
Cited In (8)
- Greedy routing and the algorithmic small-world phenomenon
- Eclecticism shrinks even small worlds
- Optimal routing in a small-world network
- Algorithms – ESA 2005
- Tight lower bounds for greedy routing in higher-dimensional small-world grids
- Navigable small-world networks with few random bits
- Kleinberg's grid unchained
- Greedy routing and the algorithmic small-world phenomenon
This page was built for publication: Eclecticism shrinks even small worlds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375296)
