A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space

被引:0
|
作者
Ilan Newman
Yuri Rabinovich
机构
[1] Computer Science Department,
[2] University of Haifa,undefined
[3] Haifa 31905,undefined
[4] Israel ilan@cs.haifa.ac.il,undefined
[5] yuri@cs.haifa.ac.il,undefined
来源
Discrete & Computational Geometry | 2002年 / 29卷
关键词
Euclidean Space; Planar Graph; Infinite Family; Planar Metrics; Embed Planar;
D O I
暂无
中图分类号
学科分类号
摘要
We exhibit a simple infinite family of series-parallel graphs that cannot be metrically embedded into Euclidean space with distortion smaller than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\Omega(\sqrt{\log n})$ \end{document} . This matches Rao's [14] general upper bound for metric embedding of planar graphs into Euclidean space, thus resolving the question how well do planar metrics embed in Euclidean spaces?
引用
收藏
页码:77 / 81
页数:4
相关论文
共 8 条
  • [1] Embedding Tree Metrics into Low-Dimensional Euclidean Spaces
    A. Gupta
    Discrete & Computational Geometry, 2000, 24 : 105 - 116
  • [2] Euclidean-Planck Metrics of Space, Particle Physics and Cosmology
    Sorli, Amrit
    Dobnikar, Uros
    Patro, Santanu Kumar
    Mageshwaran, Magi
    Fiscaletti, Davide
    NEUROQUANTOLOGY, 2018, 16 (04) : 18 - 25
  • [3] An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
    Karpov, Nikolai
    Pilipczuk, Marcin
    Zych-Pawlewicz, Anna
    ALGORITHMICA, 2019, 81 (10) : 4029 - 4042
  • [4] An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
    Nikolai Karpov
    Marcin Pilipczuk
    Anna Zych-Pawlewicz
    Algorithmica, 2019, 81 : 4029 - 4042
  • [5] Embedding complex networks in a low dimensional Euclidean space based on vertex dissimilarities
    Lee, Chang-Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (20) : 5018 - 5030
  • [6] FELLER'S UPPER-LOWER CLASS TEST IN EUCLIDEAN SPACE
    Einmahl, Uwe
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2022, 375 (09) : 6575 - 6596
  • [7] A note on the lower bound of centralized radio broadcasting for planar reachability graphs
    Galcik, F.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 853 - 857
  • [8] A lower bound on the order of the largest induced forest in planar graphs with high girth
    Dross, Francois
    Montassier, Mickael
    Pinlou, Alexandre
    DISCRETE APPLIED MATHEMATICS, 2016, 214 : 99 - 107