Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393)
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
20 February 2019
0 references
distance oracle
0 references
planar graphs
0 references
approximate algorithms
0 references
graph decomposition
0 references
0 references
