Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.08.024 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.08.024 / rank | |||
Normal rank | |||
Latest revision as of 06:02, 11 December 2024
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
