Shortest path embeddings of graphs on surfaces

DOI10.4230/LIPICS.SOCG.2016.43zbMATH Open1387.05057OpenAlexW2964025190MaRDI QIDQ3132877FDOQ3132877

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

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

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)

Cited In (5)

• Holiest minimum-cost paths and flows in surface graphs
• Stable embeddings on closed surfaces with respect to the minimum length
• Title not available (Why is that?)
• Shortest path embeddings of graphs on surfaces
• Embedding of metric graphs on hyperbolic surfaces

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)