Bandwidth and low dimensional embedding
2013
We design an algorithm to embed graph metrics into @?"p with dimension and distortion both dependent only upon the bandwidth of the graph. In particular, we show that any graph of bandwidth k embeds with distortion polynomial in k into @?"p^O^(^l^o^g^k^), 1=
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
29
References
4
Citations
NaN
KQI