The intrinsic dimensionality of graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 438-447

  Krauthgamer, Robert ^a   Lee, James R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Finite metric spaces; Graph decomposition; Growth restricted graphs; Lovasz Local Lemma; Low dimensional embeddings

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY;

LOWER BOUNDS;

GRAPH THEORY;

EID: 0038107642     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780607     Document Type: Conference Paper

References (22)

1. N. Alon and J. H. Spencer. The probabilistic method. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000.
2. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
3. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, pages 184-193. IEEE, 1996.
4. J. A. Bondy and U. S. R. Murty. Graph theory with applications. American Elsevier Publishing Co., Inc., New York, 1976.
5. A. Brandstädt, V. Chepoi, and F. Dragan. Distance approximating trees for chordal and dually chordal graphs. J. Algorithms, 30(1):166-184, 1999.
6. V. Chepoi and F. Dragan. A note on distance approximating trees in graphs. European J. Combin., 21(6):761-766, 2000.
7. F. R. K. Chung. Labelings of graphs. In Selected topics in graph theory, 3, pages 151-168. Academic Press, San Diego, CA, 1988.
8. P. Erdös, F. Harary, and W. T. Tutte. On the dimension of a graph. Mathematika, 12:118-122, 1965.
9. U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510-539, 2000.
10. J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
11. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, pages 41-52. August 2002.
12. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 10-33. October 2001.
13. D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pages 63-66, 2002.
14. P. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In 25th Annual ACM Symposium on Theory of Computing, pages 682-690, May 1993.
15. N. Linial. Variation on a theme of Levin. In J. Matoušek, Ed., Open Problems, Workshop on Discrete Metric Spaces and their Algorithmic Applications. Haifa, March 2002.
16. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
17. N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13(4):441-454, 1993.
18. L. Lovász and K. Vesztergombi. Geometric representations of graphs. In Paul Erdös, Proc. Conf., Budapest, 1999.
19. J. Matoušek. Lectures on discrete geometry, Vol. 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
20. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
21. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th Annual Symposium on Computational Geometry, pages 300-306. ACM, 1999.
22. S. Semmes. Bilipschitz embeddings of metric spaces into Euclidean spaces. Publ. Mat., 43(2):571-653, 1999.