Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation-Reference-Cited by-同舟云学术

Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation

Published: Issue: Volume: Page:2-11
ISSN:
Container-title:Algorithms – ESA 2007
language:
Short-container-title:

Author:

Fraigniaud Pierre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75520-3_2.pdf

Reference43 articles.

1. Abraham, I., Gavoille, C.: Object Location Using Path Separators. In: PODC. 25th ACM Symp. on Principles of Distributed Computing, pp. 188–197. ACM Press, New York (2006)

2. Lecture Notes in Computer Science;I. Abraham,2005

3. Andersen, R., Chung, F., Lu, L.: Modeling the small-world phenomenon with local network flow. Internet Mathematics 2(3), 359–385 (2006)

4. Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: PODC. 21st ACM Symp. on Principles of Distributed Computing, pp. 223–232. ACM Press, New York (2002)

5. Lecture Notes in Computer Science;L. Barrière,2001

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Greedy Routing and the Algorithmic Small-World Phenomenon;Proceedings of the ACM Symposium on Principles of Distributed Computing;2017-07-25

2. Theoretical Distributed Computing Meets Biology: A Review;Distributed Computing and Internet Technology;2013

3. How to Use Spanning Trees to Navigate in Graphs;Algorithmica;2012-04-18

4. Wayfinding in Social Networks;Computer Communications and Networks;2010

5. How to Use Spanning Trees to Navigate in Graphs;Mathematical Foundations of Computer Science 2009;2009