Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144)
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: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t |
scientific article; zbMATH DE number 1200784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Algorithms for Constructing t-Spanners and Paths with Stretch t |
scientific article; zbMATH DE number 1200784 |
Statements
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (English)
0 references
21 September 1998
0 references
shortest paths
0 references
graph spanners
0 references
parallel algorithms
0 references
0.8938684
0 references
0.8862169
0 references
0.8744959
0 references
0.8714544
0 references
0.8698439
0 references
0.86943465
0 references
0.86482185
0 references
0.86482185
0 references
