Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342)

From MaRDI portal
Revision as of 03:38, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Faster algorithms for all-pairs small stretch distances in weighted graphs
scientific article

    Statements

    Faster algorithms for all-pairs small stretch distances in weighted graphs (English)
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate distances
    0 references
    combinatorial algorithm
    0 references
    fast rectangular matrix multiplication
    0 references
    0 references