Using inverted trees for updating graph properties. Technical report
Technical Report
·
OSTI ID:6368355
Fast parallel algorithms are presented for updating connected components and bridges of an undirected graph when a minor change has been made to the graph, such as addition or deletion of vertices and edges. The matching model used is a parallel random-access machine that allows simultaneous reads but prohibits simultaneous writes into the same memory location. The algorithms described in this paper require O (log n) time and use C (n-squared) processors. These algorithms are efficient when compared to previously known algorithms for finding connected components and bridges that require O(log squared n) time and use 0 (n-squared) processors. The previous solution is maintained using an inverted tree (a rooted tree where a node points toward its parent) and after a minor change the new solution is rapidly computed from this tree.
- Research Organization:
- Maryland Univ., College Park (USA). Center for Automation Research
- OSTI ID:
- 6368355
- Report Number(s):
- AD-A-160135/0/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Using multiple inverted trees for parallel updating of graph properties. Technical report
Parallel update of minimum spanning trees in logarithmic time. Technical report
Incremental graph algorithms for parallel random access machines
Technical Report
·
Wed May 01 00:00:00 EDT 1985
·
OSTI ID:5520387
Parallel update of minimum spanning trees in logarithmic time. Technical report
Technical Report
·
Wed Oct 31 23:00:00 EST 1984
·
OSTI ID:5814521
Incremental graph algorithms for parallel random access machines
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6918186