Shortest Path Embeddings of Graphs on Surfaces

被引:4
|
作者
Hubard, Alfredo [1 ,2 ]
Kaluza, Vojtech [3 ]
de Mesmay, Arnaud [4 ]
Tancer, Martin [3 ,5 ]
机构
[1] INRIA Sophia Antipolis, F-77454 Marne La Vallee, France
[2] Univ Paris Est Marne la Vallee, F-77454 Marne La Vallee, France
[3] Charles Univ Prague, Dept Appl Math, Malostranske Namesti 25, CR-11800 Prague 1, Czech Republic
[4] CNRS, Gipsa Lab, 11 Rue Math, F-38402 St Martin Dheres, France
[5] Charles Univ Prague, Inst Theoret Comp Sci, Malostranske Namesti 25, CR-11800 Prague 1, Czech Republic
关键词
Embedded graphs; Shortest paths; Fary's theorem; Hyperbolic geometry; Graph drawing; IRREDUCIBLE TRIANGULATIONS;
D O I
10.1007/s00454-017-9898-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The classical theorem of Fary states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fary's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a shortest path embedding. The main question addressed in this paper is whether given a closed surface S, there exists a Riemannian metric for which every topologically embeddable graph admits a shortest path embedding. This question is also motivated by various problems regarding crossing numbers on surfaces. We observe that the round metrics on the sphere and the projective plane have this property. We provide flat metrics on the torus and the Klein bottle which also have this property. Then we show that for the unit square flat metric on the Klein bottle there exists a graph without shortest path embeddings. We show, moreover, that for large g, there exist graphs G embeddable into the orientable surface of genus g, such that with large probability a random hyperbolic metric does not admit a shortest path embedding of G, where the probability measure is proportional to the Weil-Petersson volume on moduli space. Finally, we construct a hyperbolic metric on every orientable surface S of genus g, such that every graph embeddable into S can be embedded so that every edge is a concatenation of at most O(g) shortest paths.
引用
收藏
页码:921 / 945
页数:25
相关论文
共 50 条
  • [31] On the Shortest Path in some k-connected Graphs
    Sim, K. A.
    Tan, T. S.
    Wong, K. B.
    ADVANCES IN INDUSTRIAL AND APPLIED MATHEMATICS, 2016, 1750
  • [32] LEVEL GRAPHS AND APPROXIMATE SHORTEST-PATH ALGORITHMS
    SHAPIRO, J
    WAXMAN, J
    NIR, D
    NETWORKS, 1992, 22 (07) : 691 - 717
  • [33] A Shortest Path Query Method over Temporal Graphs
    Zhang T.
    Xu Y.
    Cai X.
    Fan J.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2022, 59 (02): : 362 - 375
  • [34] Reconstructing Cactus Graphs from Shortest Path Information
    Kranakis, Evangelos
    Krizanc, Danny
    Lu, Yun
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2016, 9778 : 150 - 161
  • [35] COMPUTATION OF SHORTEST PATH IN GRAPHS AND APPROPRIATE DATA STRUCTURES
    BRAESS, D
    COMPUTING, 1971, 8 (1-2) : 171 - &
  • [36] Shortest path algorithm for graphs in instances of semantic optimization
    Lavlinskaya, O. Yu
    Kurchenkova, T., V
    Kuripta, O., V
    APPLIED MATHEMATICS, COMPUTATIONAL SCIENCE AND MECHANICS: CURRENT PROBLEMS, 2020, 1479
  • [37] DISTRIBUTED COMPUTATION ON GRAPHS - SHORTEST-PATH ALGORITHMS
    CHANDY, KM
    MISRA, J
    COMMUNICATIONS OF THE ACM, 1982, 25 (11) : 833 - 837
  • [38] On finding a shortest path in circulant graphs with two jumps
    Gómez, D
    Gutierrez, J
    Ibeas, A
    Martínez, C
    Beivide, R
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 777 - 786
  • [39] Improved shortest path algorithms for nearly acyclic graphs
    Saunders, S
    Takaoka, T
    THEORETICAL COMPUTER SCIENCE, 2003, 293 (03) : 535 - 556
  • [40] Parallel Shortest-Path Queries in Planar Graphs
    Aleksandrov, Lyudmil
    Chapuis, Guillaume
    Djidjev, Hristo
    PROCEEDINGS OF THE ACM WORKSHOP ON HIGH PERFORMANCE GRAPH PROCESSING (HPGP'16), 2016, : 9 - 16