Parallel algorithms for the connected components and minimal spanning tree problems (Q1162158): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(82)90131-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033887412 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing connected components on parallel computers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3667941 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Processing with the Perfect Shuffle / rank | |||
Normal rank | |||
Latest revision as of 15:10, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for the connected components and minimal spanning tree problems |
scientific article |
Statements
Parallel algorithms for the connected components and minimal spanning tree problems (English)
0 references
1982
0 references
