Towards small world emergence
作者： Philippe Duchon , Nicolas Hanusse , Emmanuelle Lebhar , Nicolas Schabanel
关键词:
摘要: … the resulting network is a navigable small world, ie, in which greedy rout… Previously known small world augmentation processes … growth graph into a small world with high probability in …
acm.org
archives-ouvertes.fr
sci-hub.se 
uchile.cl 参考文章(20)
Lali Barriére, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc, Efficient Routing in Networks with Long Range Contacts international symposium on distributed computing. pp. 270- 284 ,(2001) , 10.1007/3-540-45414-4_19
S. Milgram, The Small World Problem Psychology today. ,vol. 1, pp. 60- 67 ,(1967)
Pierre Fraigniaud, Greedy Routing in Tree-Decomposed Graphs Algorithms – ESA 2005. pp. 791- 802 ,(2005) , 10.1007/11561071_70
Sariel Har-Peled, Manor Mendel, Fast construction of nets in low dimensional metrics, and their applications symposium on computational geometry. pp. 150- 158 ,(2005) , 10.1145/1064092.1064117
Cyril Gavoille, David Peleg, Compact and localized distributed data structures Distributed Computing. ,vol. 16, pp. 111- 120 ,(2003) , 10.1007/S00446-002-0073-5
Robert Krauthgamer, James R. Lee, Navigating nets: simple algorithms for proximity search symposium on discrete algorithms. pp. 798- 807 ,(2004) , 10.5555/982792.982913
Mikkel Thorup, Uri Zwick, Approximate distance oracles Journal of the ACM. ,vol. 52, pp. 1- 24 ,(2005) , 10.1145/1044731.1044732
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel, Could any graph be turned into a small-world? Theoretical Computer Science. ,vol. 355, pp. 96- 103 ,(2006) , 10.1016/J.TCS.2005.12.008
Pierre Fraigniaud, Philippe Gauron, Brief announcement Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03. pp. 151- 151 ,(2003) , 10.1145/872035.872056
Jie Gao, Leonidas J. Guibas, An Nguyen, Deformable spanners and applications symposium on computational geometry. pp. 190- 199 ,(2004) , 10.1145/997817.997848