Parallel update of minimum spanning trees in logarithmic time. Technical report
Technical Report
·
OSTI ID:5814521
Parallel algorithms are presented for updating a minimum spanning tree when the cost of an edge changes or when a new node is inserted in the underlying graph. The machine model used is a parallel random access machine which allows simultaneous reads but prohibits simultaneous writes into the same memory location. The algorithms described in this paper for updating a minimum spanning tree require O(log n) time and O(n square) processors. These algorithms are efficient when compared to previously known algorithms for initial construction of a minimum spanning tree that require O(log n to the base 2) time and use O(n square) processors.
- Research Organization:
- Maryland Univ., College Park (USA). Center for Automation Research
- OSTI ID:
- 5814521
- Report Number(s):
- AD-A-150497/6/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Using inverted trees for updating graph properties. Technical report
Using multiple inverted trees for parallel updating of graph properties. Technical report
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Technical Report
·
Wed May 01 00:00:00 EDT 1985
·
OSTI ID:6368355
Using multiple inverted trees for parallel updating of graph properties. Technical report
Technical Report
·
Wed May 01 00:00:00 EDT 1985
·
OSTI ID:5520387
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6930310