Fast Approximate Shortest Paths in the Congested Clique (Q5145183)

From MaRDI portal
Revision as of 04:15, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7298658
Language Label Description Also known as
English
Fast Approximate Shortest Paths in the Congested Clique
scientific article; zbMATH DE number 7298658

    Statements

    Fast Approximate Shortest Paths in the Congested Clique (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 January 2021
    0 references
    all-pairs shortest paths
    0 references
    approximation algorithms
    0 references
    congested clique
    0 references
    diameter
    0 references
    distributed computing
    0 references
    hopsets
    0 references
    matrix multiplication
    0 references
    single-source shortest paths
    0 references

    Identifiers