The intrinsic dimensionality of graphs
- 9 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 438-447
- https://doi.org/10.1145/780542.780607
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Distributed object location in a dynamic networkPublished by Association for Computing Machinery (ACM) ,2002
- Finding nearest neighbors in growth-restricted metricsPublished by Association for Computing Machinery (ACM) ,2002
- A Note on Distance Approximating Trees in GraphsEuropean Journal of Combinatorics, 2000
- Approximating the Bandwidth via Volume Respecting EmbeddingsJournal of Computer and System Sciences, 2000
- Small distortion and volume preserving embeddings for planar and Euclidean metricsPublished by Association for Computing Machinery (ACM) ,1999
- Distance Approximating Trees for Chordal and Dually Chordal GraphsJournal of Algorithms, 1999
- Low diameter graph decompositionsCombinatorica, 1993
- Excluded minors, network decomposition, and multicommodity flowPublished by Association for Computing Machinery (ACM) ,1993
- Plongements lipschitziens dans ${\bbfR}\sp n$Bulletin de la Société Mathématiques de France, 1983
- On the dimension of a graphMathematika, 1965