Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time |
scientific article |
Statements
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (English)
0 references
22 August 2013
0 references
planar graph
0 references
Wiener index
0 references
diameter
0 references
shortest path distances
0 references
distance oracle
0 references
