Sciweavers

STOC
2003
ACM
87views Algorithms» more  STOC 2003»
14 years 12 months ago
The intrinsic dimensionality of graphs
We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occ...
Robert Krauthgamer, James R. Lee