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