Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Micha Sharir / rank | |||
| Property / author | |||
| Property / author: Micha Sharir / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:48, 7 March 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
