An O(log n) algorithm for parallel update of minimum spanning trees (Q1075769)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3952027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(log n) algorithm for parallel update of minimum spanning trees |
scientific article; zbMATH DE number 3952027 |
Statements
An O(log n) algorithm for parallel update of minimum spanning trees (English)
0 references
1986
0 references
graph algorithm
0 references
