An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346)
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: An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem |
scientific article; zbMATH DE number 167752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem |
scientific article; zbMATH DE number 167752 |
Statements
An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (English)
0 references
16 May 1993
0 references
complexity
0 references
components
0 references
sorting
0 references
non-numerical algorithms
0 references
parallel algorithm
0 references
minimum spanning tree
0 references
undirected graph
0 references
0 references
0.9533076
0 references
0.94734246
0 references
0.9441807
0 references
0.9432395
0 references
0.94295937
0 references
