A systematic study is carried out focusing on the relationship between the topology of a graph and the metric distortion incurred when the graph is embedded into l1 space. Explicit constant-distortion embeddings of all series-parallel graphs, and all graphs with bounded Euler number are derived. Further, a constant-distortion embedding of outerplanar graphs into the restricted class of l1-metrics known as 'dominating tree metrics' is shown.
|Number of pages||10|
|Journal||Annual Symposium on Foundations of Computer Science - Proceedings|
|State||Published - 1999|
|Event||Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA|
Duration: 17 Oct 1999 → 19 Oct 1999
ASJC Scopus subject areas
- Hardware and Architecture