Efficient Routing in Networks with Long Range Contacts
- 11 September 2001
- book chapter
- Published by Springer Nature
- p. 270-284
- https://doi.org/10.1007/3-540-45414-4_19
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A random graph model for massive graphsPublished by Association for Computing Machinery (ACM) ,2000
- Graph Theory in Practice: Part IAmerican Scientist, 2000
- Graph Theory in Practice: Part IIAmerican Scientist, 2000
- On power-law relationships of the Internet topologyPublished by Association for Computing Machinery (ACM) ,1999
- The Web as a Graph: Measurements, Models, and MethodsPublished by Springer Nature ,1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Probabilistic recurrence relationsPublished by Association for Computing Machinery (ACM) ,1991
- The Diameter of a Cycle Plus a Random MatchingSIAM Journal on Discrete Mathematics, 1988
- Constructing a perfect matching is in random NCCombinatorica, 1986
- Diameter bounds for altered graphsJournal of Graph Theory, 1984