Big-Bang simulation for embedding network distances in Euclidean space
- 2 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Characterizing the Internet hierarchy from multiple vantage pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- Dynamic distance maps of the InternetPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Constrained mirror placement on the InternetIEEE Journal on Selected Areas in Communications, 2002
- Topology aggregation for directed graphsIEEE/ACM Transactions on Networking, 2001
- Topology of Evolving Networks: Local Events and UniversalityPhysical Review Letters, 2000
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984
- A Simplex Method for Function MinimizationThe Computer Journal, 1965