Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STOC
2003
ACM

favoriteEmaildiscussreport

87views Algorithms» more STOC 2003»

The intrinsic dimensionality of graphs

14 years 4 months ago

The intrinsic dimensionality of graphs

Download www.wisdom.weizmann.ac.il

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 occurs as a (not necessarily induced) subgraph of Zd , the infinite graph with vertex set Zd and an

Robert Krauthgamer, James R. Lee

Real-time Traffic

Algorithms | STOC 2003 | Vertex Set Zd |

claim paper

Related Content

» Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps

» Optimized intrinsic dimension estimator using nearest neighbor graphs

» Diffusion Maps and CoarseGraining A Unified Framework for Dimensionality Reduction Graph P...

» Graph Embedding and Extensions A General Framework for Dimensionality Reduction

» Sampledependent graph construction with application to dimensionality reduction

» Entire regularization paths for graph data

» Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering

» Graph Mining with Variational Dirichlet Process Mixture Models

» Orthogonal Neighborhood Preserving Projections A ProjectionBased Dimensionality Reduction ...

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Robert Krauthgamer, James R. Lee

Comments (0)