\(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (Q1391774)

From MaRDI portal
Revision as of 04:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
\(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms
scientific article

    Statements

    \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (English)
    0 references
    0 references
    23 July 1998
    0 references
    0 references
    divide-and-conquer
    0 references
    parallel topologies
    0 references
    transformations
    0 references
    transputer
    0 references