An efficient oracle for counting shortest paths in planar graphs (Q5918687)
From MaRDI portal
scientific article; zbMATH DE number 7530341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient oracle for counting shortest paths in planar graphs |
scientific article; zbMATH DE number 7530341 |
Statements
An efficient oracle for counting shortest paths in planar graphs (English)
0 references
23 May 2022
0 references
oracles for counting shortest paths
0 references
distance oracles
0 references
Voronoi diagrams on planar graphs
0 references
computational study
0 references
0 references
0 references
