O(1) Parallel Time Incremental Graph Algorithms

Fast parallel algorithms are presented for updating minimum spanning trees, connected components and bridges of an undirected graph when a minor change is made to the graph such as addition or deletion of a vertex or an edge. The machine model used is a parallel random access machine that allows simultaneous reads as well as simultaneous writes into the same memory location. In the latter case one processor succeeds but we do not know which. The algorithms described in this paper require O(1) time and are efficient when compared to previously known O(logn) time algorithms for initial computation of the above mentioned graph properties on this model. An important feature of our algorithms is their versatility, that is, they can be adapted to run efficiently on all variations of this model with very little modification.

[1]  S. N. Maheshwari,et al.  Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems , 1982, Inf. Process. Lett..

[2]  Grant Arthur Cheston.  Incremental algorithms in graph theory. , 1976 .

[3]  Ludek Kucera,et al.  Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.

[4]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[5]  Joseph JáJá,et al.  Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..

[6]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[7]  Francis Y. L. Chin,et al.  Efficient parallel algorithms for some graph problems , 1982, CACM.

[8]  Yung H. Tsin,et al.  Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

[9]  Frank Harary,et al.  Graph Theory , 2016 .

[10]  Stephen A. Cook,et al.  Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.

[11]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[12]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[13]  Francis Y. L. Chin,et al.  Algorithms for Updating Minimal Spanning Trees , 1978, J. Comput. Syst. Sci..

[14]  Toshihide Ibaraki,et al.  On-Line Computation of Transitive Closures of Graphs , 1983, Inf. Process. Lett..

[15]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[16]  Uzi Vishkin,et al.  Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[17]  I. V. Ramakrishnan,et al.  An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees , 1986, Inf. Process. Lett..

[18]  Uzi Vishkin,et al.  Implementation of Simultaneous Memory Address Access in Models That Forbid It , 1983, J. Algorithms.

[19]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[20]  I. V. Ramakrishnan,et al.  Parallel Updates of Graph Properties in Logarithmic Time , 1985, ICPP.