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

From MaRDI portal
Revision as of 15:22, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
scientific article

    Statements

    title
    Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    17 June 2002
    0 references
    zbMATH DE Number
    1756781
    0 references
    zbMATH Keywords
    coarse grained parallel computing
    0 references
    graph algorithms
    0 references
    author
    Frank Dehne
    0 references
    Afonso G. Ferreira
    0 references
    E. N. Cáceres
    0 references
    Siang W. Song
    0 references
    Alessandro Roncato
    0 references
    OpenAlex ID
    W2012042319
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1601013&oldid=31148101"
    Powered by MediaWiki