Graph algorithms with small communication costs (Q1587586)

From MaRDI portal
Revision as of 23:13, 21 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Graph algorithms with small communication costs
scientific article

    Statements

    Graph algorithms with small communication costs (English)
    0 references
    0 references
    0 references
    0 references
    3 December 2000
    0 references
    course-grained parallel algorithms
    0 references
    list ranking
    0 references
    shortest path
    0 references
    permutation graph
    0 references
    commutation phase
    0 references

    Identifiers