\(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (Q1391774)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms |
scientific article; zbMATH DE number 1178537
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms |
scientific article; zbMATH DE number 1178537 |
Statements
\(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (English)
0 references
23 July 1998
0 references
divide-and-conquer
0 references
parallel topologies
0 references
transformations
0 references
transputer
0 references
