Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 04:32, 29 February 2024
scientific article; zbMATH DE number 7333145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time |
scientific article; zbMATH DE number 7333145 |
Statements
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (English)
0 references
14 April 2021
0 references
Voronoi diagrams
0 references
diameter
0 references
planar graph
0 references
shortest paths
0 references
divide-and-conquer
0 references
