Shortest path embeddings of graphs on surfaces

DOI10.4230/LIPICS.SOCG.2016.43MaRDI QIDQ3132877zbMATHOpenAlexFDO

Authors Alfredo Hubard, Vojtěch Kaluža, Arnaud de Mesmay, Martin Tancer

Publication date 30 January 2018

Full work available at URL https://hal.univ-grenoble-alpes.fr/hal-01355135

zbMATH Keywords

surfacehyperbolic geometryshortest pathgraph embeddingcrossing number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• Shortest path embeddings of graphs on surfaces
• Embedding of metric graphs on hyperbolic surfaces
• Probabilistic embeddings of bounded genus graphs into planar graphs
• Plane embeddings of planar graph metrics
• Plane embeddings of planar graph metrics

Cited in

(5)

• scientific article; zbMATH DE number 6783474 (Why is no real title available?)
• Holiest minimum-cost paths and flows in surface graphs
• Embedding of metric graphs on hyperbolic surfaces
• Shortest path embeddings of graphs on surfaces
• Stable embeddings on closed surfaces with respect to the minimum length

This page was built for publication: Shortest path embeddings of graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132877)