A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) (Q2565696): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jpdc.2005.03.011 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56271079 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2005.03.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028583484 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JPDC.2005.03.011 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:34, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) |
scientific article |
Statements
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) (English)
0 references
28 September 2005
0 references
PRAM algorithms
0 references
shared-memory parallel computers
0 references
