Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs (Q3459900)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs |
scientific article |
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
