scientific article; zbMATH DE number 2006658
From MaRDI portal
Publication:4436057
zbMath1024.68501MaRDI QIDQ4436057
Pierre Fraigniaud, Evangelos Kranakis, Lali Barrière, Danny Krizanc
Publication date: 23 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800270.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (17)
D2B: A de Bruijn based content-addressable network ⋮ Could any graph be turned into a small-world? ⋮ Eclecticism shrinks even small worlds ⋮ Orientation in social networks ⋮ Kleinberg's grid unchained ⋮ Asymptotically optimal solutions for small world graphs ⋮ Depth of Field and Cautious-Greedy Routing in Social Networks ⋮ Neighbor selection and hitting probability in small-world graphs ⋮ Recovering the long-range links in augmented graphs ⋮ Greedy routing in small-world networks with power-law degrees ⋮ Navigation in spatial networks: a survey ⋮ Optimal routing in a small-world network ⋮ Universal augmentation schemes for network navigability ⋮ Estimating network size from local information ⋮ Graph Embedding through Random Walk for Shortest Paths Problems ⋮ Navigable small-world networks with few random bits ⋮ Close to optimal decentralized routing in long-range contact networks
This page was built for publication:
