An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (Q3985808): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56271078, #quickstatements; #temporary_batch_1711234560214 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1137/0220066 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2125182537 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56271078 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:59, 24 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph |
scientific article |
Statements
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (English)
0 references
27 June 1992
0 references
parallel randomized algorithm
0 references
connected components
0 references
CRCW
0 references
