Greedy routing in small-world networks with power-law degrees
From MaRDI portal
Publication:2256946
DOI10.1007/S00446-014-0210-YzbMath1319.68028OpenAlexW1974041154MaRDI QIDQ2256946
George Giakkoupis, Pierre Fraigniaud
Publication date: 23 February 2015
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01097141/file/DIST14_sw.pdf
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14) Network protocols (68M12)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The diameter of a scale-free random graph
- Could any graph be turned into a small-world?
- On the searchability of small-world networks with arbitrary underlying structure
- Statistical mechanics of complex networks
- The small-world phenomenon
- Know thy neighbor's neighbor
- The Structure and Function of Complex Networks
- The Average Distance in a Random Graph with Given Expected Degrees
- Tight bounds for blind search on the integers
- The effect of power-law degrees on the navigability of small worlds
- Fault-tolerant routing in peer-to-peer systems
- Tight lower bounds for greedy routing in uniform small world rings
- Distance estimation and object location via rings of neighbors
- Object location using path separators
- Collective dynamics of ‘small-world’ networks
- Distributed Computing
- On the complexity of greedy routing in ring-based peer-to-peer networks
- Optimal path search in small worlds
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Eclecticism shrinks even small worlds
- Analyzing Kleinberg's (and other) small-world Models
This page was built for publication: Greedy routing in small-world networks with power-law degrees
