Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743)
From MaRDI portal
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
