An efficient parallel algorithm for updating minimum spanning trees (Q1105383)
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 efficient parallel algorithm for updating minimum spanning trees |
scientific article; zbMATH DE number 4058883
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for updating minimum spanning trees |
scientific article; zbMATH DE number 4058883 |
Statements
An efficient parallel algorithm for updating minimum spanning trees (English)
0 references
1988
0 references
CREW-PRAM
0 references
parallel algorithm
0 references
updating
0 references
minimum spanning tree
0 references
time complexity
0 references
0.97105277
0 references
0.9586172
0 references
0.95375437
0 references
0 references
