Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013)

From MaRDI portal
Revision as of 19:54, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
scientific article

    Statements

    Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2002
    0 references
    coarse grained parallel computing
    0 references
    graph algorithms
    0 references

    Identifiers