Drawing Shortest Paths in Geodetic Graphs
From MaRDI portal
Publication:5050002
DOI10.7155/JGAA.00598zbMATH Open1498.05145OpenAlexW3063684895MaRDI QIDQ5050002FDOQ5050002
Authors:
Publication date: 14 November 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00598
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
- scientific article; zbMATH DE number 7716260
- 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
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- On a problem of K. Zarankiewicz
- On Moore Graphs with Diameters 2 and 3
- Title not available (Why is that?)
- Title not available (Why is that?)
- Euclidean shortest paths in the presence of rectilinear barriers
- On the Structure of Unique Shortest Paths in Graphs
- Some general constructions of geodetic blocks
- Geodetic graphs of diameter two
- On planar geodetic graphs
- Which crossing number is it anyway?
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geodetic graphs of diameter two and some related structures
- A characterization of planar geodetic graphs
Cited In (1)
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)
