Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time |
scientific article; zbMATH DE number 6200815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time |
scientific article; zbMATH DE number 6200815 |
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
0.8500226140022278
0 references
0.8475924134254456
0 references
0.8368454575538635
0 references
0.8336140513420105
0 references
0.8300952315330505
0 references
