Abstract
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.
Research supported by AFOSR grant AFOSR-82-0303 and NSF grant MCS-83-05992.
Research supproted by AFOSR grant F-49620-83-C-0082.
Research supported by by ONR grant N00014-84-K-0530 and NSF grant ECS-84-04399. Author's present address: Dept. of Computer Science, SUNY, Stony Brook, NY 11794.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Cheston, “Incremental Algorithms in Graph Theory”, TR 91 (1976), Dept. of Computer Science, Univ. of Toronto, Toronto.
F. Chin and D. Houck, “Algorithms for Updating Minimum Spanning Trees”, Journal of Computer and System Sciences, 16 (1978), pp. 333–344.
S. Cook and C. Dwork, “Bounds on the Time for Parallel RAMs to Compute Simple Functions”, Proc. 14th ACM Symposium on Theory of Computing, 1982, pp. 231–233.
S. Even and Y. Shlloach, “An On-line Edge Deletion Problem”, Journal of ACM, 28 (1982), pp. 1–4.
G. Frederickson, “Data Structures for On-line Updating of Minimum Spanning Trees”, Proc. 15th ACM Symposium on Theory of Computing (1983), pp. 252–257.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
T. Ibaraki and N. Katoh, “On-line Computation of Transitive Closure of Graphs”, Information Processing Letters, 16 (1983), pp 95–97.
L. Kucera, “Parallel Computation and Conflicts in Memory Access”, Information Processing Letters, 14 (1982), pp. 93–96.
D. Nath and S.N. Maheshwari, “Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems”, Information Processing Letters, 14 (1982), pp. 7–10.
S. Pawagi and I.V. Ramakrishnan, “An O(logn) Algorithm for Parallel Updates of Minimum Spanning Trees”, Information Processing Letters, (to appear).
S. Pawagl and I.V. Ramakrishnan, “Parallel Updates of Graph Properties in Logarithmic Time”, Proc. 14th International Conference on Parallel Processing (1985), St. Charles, Illinois.
C. Savage, “Parallel Algorithms for Some Graph Problems”, TR-784 (1977), Dept. of Mathematics, Univ. of Illinois, Urbana.
C. Savage and J. Ja'Ja', “Fast Efficient Parallel Algorithms for Some Graph Problems”, SIAM Journal on Computing, 10 (1981), pp. 682–691.
P. Spira and A. Pan, “On Finding and Updating Spanning Trees and Shortest Paths”, SIAM Journal on Computing, 4 (1975), pp. 375–380.
D.D. Sherlekar, S. Pawagi and I.V. Ramakrishnan, “Fast Incremental Parallel Algorithms for Graph Problems on PRAMs”, Technical Report, U. of Maryland, 1985 (in preparation).
Y. Shiloach and U. Vishkin, “Finding the Maximum, Merging and Sorting in a Parallel Computation Model”, Journal of Algorithms, 2 (1981), pp. 88–102.
Y. Shiloach and U. Vishkin, “An O(logn) Parallel Connectivity Algorithm”, Journal of Algorithms, 3 (1982), 57–63.
R.E. Tarjan and U. Vishkin, “Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time”, Proc. 23rd Annual Symp. on Foundations of Computer Science (1984), pp. 12–20.
Y. Tsin and F. Chin, “Efficient Parallel Algorithms for a Class of Graph Theoretic Problems”, SIAM Journal on Computing, 14 (1984), pp. 580–599.
L.G. Vallant, “Parallelism in Comparison Problems”, SIAM Journal on Computing, 4 (1975), pp. 348–355.
U. Vishkin, “Implementation of simultaneous Memory Access in Models That Forbid it”, Journal of Algorithms, 4 (1983), pp. 45–50.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sherlekar, D.D., Pawagi, S., Ramakrishnan, I.V. (1985). O(1) parallel time incremental graph algorithms. In: Maheshwari, S.N. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1985. Lecture Notes in Computer Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16042-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-16042-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16042-7
Online ISBN: 978-3-540-39722-9
eBook Packages: Springer Book Archive