Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6028472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for all-pairs small stretch distances in weighted graphs |
scientific article; zbMATH DE number 6028472 |
Statements
Faster algorithms for all-pairs small stretch distances in weighted graphs (English)
0 references
26 April 2012
0 references
approximate distances
0 references
combinatorial algorithm
0 references
fast rectangular matrix multiplication
0 references
0.9905818104743958
0 references
0.8932260274887085
0 references
0.8867426514625549
0 references
0.8867426514625549
0 references
0.8507862091064453
0 references
