O(1) parallel time incremental graph algorithms

  • Deepak D. Sherlekar
  • Shaunak Pawagi
  • I. V. Ramakrishnan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 206)


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.


Span Tree Minimum Span Tree Cycle Basis Incremental Algorithm Tree Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [C76]
    G. Cheston, “Incremental Algorithms in Graph Theory”, TR 91 (1976), Dept. of Computer Science, Univ. of Toronto, Toronto.Google Scholar
  2. [CH78]
    F. Chin and D. Houck, “Algorithms for Updating Minimum Spanning Trees”, Journal of Computer and System Sciences, 16 (1978), pp. 333–344.CrossRefGoogle Scholar
  3. [CD82]
    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.Google Scholar
  4. [ES82]
    S. Even and Y. Shlloach, “An On-line Edge Deletion Problem”, Journal of ACM, 28 (1982), pp. 1–4.Google Scholar
  5. [F83]
    G. Frederickson, “Data Structures for On-line Updating of Minimum Spanning Trees”, Proc. 15th ACM Symposium on Theory of Computing (1983), pp. 252–257.Google Scholar
  6. [H69]
    F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.Google Scholar
  7. [IK83]
    T. Ibaraki and N. Katoh, “On-line Computation of Transitive Closure of Graphs”, Information Processing Letters, 16 (1983), pp 95–97.CrossRefGoogle Scholar
  8. [K82]
    L. Kucera, “Parallel Computation and Conflicts in Memory Access”, Information Processing Letters, 14 (1982), pp. 93–96.CrossRefGoogle Scholar
  9. [NM82]
    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.CrossRefGoogle Scholar
  10. [PR]
    S. Pawagi and I.V. Ramakrishnan, “An O(logn) Algorithm for Parallel Updates of Minimum Spanning Trees”, Information Processing Letters, (to appear).Google Scholar
  11. [PR85]
    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.Google Scholar
  12. [S77]
    C. Savage, “Parallel Algorithms for Some Graph Problems”, TR-784 (1977), Dept. of Mathematics, Univ. of Illinois, Urbana.Google Scholar
  13. [SJ81]
    C. Savage and J. Ja'Ja', “Fast Efficient Parallel Algorithms for Some Graph Problems”, SIAM Journal on Computing, 10 (1981), pp. 682–691.CrossRefGoogle Scholar
  14. [SP75]
    P. Spira and A. Pan, “On Finding and Updating Spanning Trees and Shortest Paths”, SIAM Journal on Computing, 4 (1975), pp. 375–380.CrossRefGoogle Scholar
  15. [SPR85]
    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).Google Scholar
  16. [SV81]
    Y. Shiloach and U. Vishkin, “Finding the Maximum, Merging and Sorting in a Parallel Computation Model”, Journal of Algorithms, 2 (1981), pp. 88–102.CrossRefGoogle Scholar
  17. [SV82]
    Y. Shiloach and U. Vishkin, “An O(logn) Parallel Connectivity Algorithm”, Journal of Algorithms, 3 (1982), 57–63.CrossRefGoogle Scholar
  18. [TV84]
    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.Google Scholar
  19. [TC84]
    Y. Tsin and F. Chin, “Efficient Parallel Algorithms for a Class of Graph Theoretic Problems”, SIAM Journal on Computing, 14 (1984), pp. 580–599.CrossRefGoogle Scholar
  20. [V75]
    L.G. Vallant, “Parallelism in Comparison Problems”, SIAM Journal on Computing, 4 (1975), pp. 348–355.Google Scholar
  21. [V83]
    U. Vishkin, “Implementation of simultaneous Memory Access in Models That Forbid it”, Journal of Algorithms, 4 (1983), pp. 45–50.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Deepak D. Sherlekar
    • 1
  • Shaunak Pawagi
    • 1
  • I. V. Ramakrishnan
    • 1
  1. 1.Department of Computer SclenceUniversity of MarylandCollege Park

Personalised recommendations