Fast Approximate Shortest Paths in the Congested Clique (Q5145183): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963015907 / rank
 
Normal rank

Latest revision as of 19:09, 19 March 2024

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
    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
    0 references