Constant query time \((1+\epsilon)\)-approximate distance oracle for planar graphs (Q3459900)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6528569
| 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 6528569 |
Statements
Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs (English)
0 references
11 January 2016
0 references
distance oracle
0 references
planar graphs
0 references
approximate algorithms
0 references
graph decomposition
0 references
0.9967578649520874
0 references
0.9371541142463684
0 references
0.9319462776184082
0 references
0.9066751599311828
0 references
0.9026191830635072
0 references
