Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393)
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 query time (1 + )-approximate distance oracle for planar graphs |
scientific article; zbMATH DE number 7026785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs |
scientific article; zbMATH DE number 7026785 |
Statements
Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (English)
0 references
20 February 2019
0 references
distance oracle
0 references
planar graphs
0 references
approximate algorithms
0 references
graph decomposition
0 references
0 references
0.9967578649520874
0 references
0.930054247379303
0 references
0.9234539866447448
0 references
0.8996805548667908
0 references
0.8941938877105713
0 references
