Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time (Q5858646)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7333145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0.991906762123108
0 references
0.8528432846069336
0 references
0.8460292816162109
0 references
0.8436816930770874
0 references
0.8429275155067444
0 references
