On certain connectivity properties of the Internet topology
Authors:
- M. MihailMMM. Mihail
- C. PapadimitriouCPC. Papadimitriou
- A. SaberiASA. Saberi
- 1 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 28-35
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- The cover time of sparse random graphsRandom Structures & Algorithms, 2006
- Spectra of random graphs with given expected degreesProceedings of the National Academy of Sciences, 2003
- A general model of web graphsRandom Structures & Algorithms, 2003
- The average distances in random graphs with given expected degreesProceedings of the National Academy of Sciences, 2002
- The Diameter of Sparse Random GraphsAdvances in Applied Mathematics, 2001
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Algorithmic Mechanism DesignGames and Economic Behavior, 2001
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Randomized Algorithms1995
- Bounds on the cover timeJournal of Theoretical Probability, 1989