Drawing Shortest Paths in Geodetic Graphs

DOI10.1007/978-3-030-68766-3_26MaRDI QIDQ5014127zbMATH OpenOpenAlexFDO

Authors

Publication date 1 December 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.07637

zbMATH Keywords

geodetic graphsedge crossingsunique shortest paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Drawing Shortest Paths in Geodetic Graphs
• Finding Shortest Paths With Computational Geometry
• Geometric k Shortest Paths
• Shortest-Path Queries in Geometric Networks
• Efficient computation of geodesic shortest paths
• Geodetic bounds in graphs
• scientific article; zbMATH DE number 4025472
• A characterization of geodetic graphs
• Searching shortest paths on a set of geometric objects
• scientific article; zbMATH DE number 1424303

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3754755 (Why is no real title available?)
• scientific article; zbMATH DE number 3540829 (Why is no real title available?)
• scientific article; zbMATH DE number 3421490 (Why is no real title available?)
• A characterization of planar geodetic graphs
• A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
• Euclidean shortest paths in the presence of rectilinear barriers
• Geodetic graphs of diameter two and some related structures
• On Moore Graphs with Diameters 2 and 3
• On a problem of K. Zarankiewicz
• On planar geodetic graphs
• On the structure of unique shortest paths in graphs
• Some general constructions of geodetic blocks
• Which crossing number is it anyway?

Cited in

(3)

• Shortest path geometric rounding
• Drawing Shortest Paths in Geodetic Graphs
• Are there graphs whose shortest path structure requires large edge weights?

This page was built for publication: Drawing Shortest Paths in Geodetic Graphs

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