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
- 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
- Geodetic graphs of diameter two and some related structures
- 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?)
- On a problem of K. Zarankiewicz
- On Moore Graphs with Diameters 2 and 3
- 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?
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 Q5050002)
