Bandwidth and low dimensional embedding

  • Authors:
  • Yair Bartal;Douglas E. Carroll;Adam Meyerson;Ofer Neiman

  • Affiliations:
  • Institute of Computer Science, Hebrew University of Jerusalem, Israel;NetSeer, Inc., Mountain View, CA, United States;Department of Computer Science, University of California, Los Angeles, CA, United States;Department of Computer Science, Ben Gurion University of the Negev, Beer-Sheva, Israel

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2013

Quantified Score

Hi-index 5.23

Visualization

Abstract

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=