A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56077919, #quickstatements; #temporary_batch_1704735187142 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56077919 / rank | |||
Normal rank | |||
Revision as of 19:46, 8 January 2024
scientific article; zbMATH DE number 1848443
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest |
scientific article; zbMATH DE number 1848443 |
Statements
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (English)
0 references
5 January 2003
0 references
parallel algorithm
0 references
minimum spanning tree
0 references
optimal algorithm
0 references
EREW PRAM
0 references
