Computing almost shortest paths (Q5892152)
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: Computing almost shortest paths |
scientific article; zbMATH DE number 6477830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing almost shortest paths |
scientific article; zbMATH DE number 6477830 |
Statements
Computing almost shortest paths (English)
0 references
2 September 2015
0 references
graph algorithms
0 references
almost shortest paths
0 references
spanners
0 references
0.994577705860138
0 references
0.8431796431541443
0 references
0.8425093293190002
0 references
0.8425093293190002
0 references
