Analysis of farthest point sampling for approximating geodesics in a graph (Q679744)
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: Analysis of farthest point sampling for approximating geodesics in a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of farthest point sampling for approximating geodesics in a graph |
scientific article |
Statements
Analysis of farthest point sampling for approximating geodesics in a graph (English)
0 references
19 January 2018
0 references
farthest point sampling
0 references
approximate geodesics
0 references
shortest paths
0 references
planar graphs
0 references
approximation algorithms
0 references
0 references
0.7151927947998047
0 references
0.6969614624977112
0 references
0.6874392628669739
0 references
