Advertisement

A partially persistent data structure for the set-union problem with backtracking

  • Carlo Gaibisso
Chapter 3 Algorithmics
  • 102 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 381)

Abstract

An extension of the well known Set-Union problem is considered, where searching in the history of the partition and backtracking over the Union operations are possible. A partially persistent data structure is presented which maintains a partitions of an n-item set and performs each Union, each Find and each search in the past in O(lg n) time per operation, at the same time allowing to backtrack, over the sequence of Unions in costant time. The space complexity of such a structure is O(n).

Keywords

Space Complexity Union Operation Array Access Space Complexity Analysis Void Link 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman, “The Design and Analysis of Computer Algorithms”, Addison-Wesley (1974).Google Scholar
  2. [2]
    N. Blum, “On the Single Operation Worst Case Time Complexity of the Disjoint Set-Union Problem”, Proc. 2nd Symp. on Theretical Aspects of Computer Science (1985).Google Scholar
  3. [3]
    B. Bollobas, I. Simon, “On the Expected Behavior of Disjoint Set-Union Algorithms”, Proc. 17th ACM Symp. on Theory of Computing (1985).Google Scholar
  4. [4]
    J.R. Driscoll, N. Sarnak, D.D. Sleator, R.E. Tarjan, “Making Data Structures Persistent”, Proc. 18th Symp. on Theory of Computing STOC (1986).Google Scholar
  5. [5]
    M.J. Fischer, “Efficiency of Equivalence Algorithms”, in Complexity of Computations, R.E. Miller and J.W. Thatcher, eds., Plenum Press, New York (1972).Google Scholar
  6. [6]
    H.N. Gabow, R.E. Tarjan, “A Linear Time Algorithm for a Special Case of Disjoint Set-Union”, Proc. 15th ACM Symp. on Theory of Computing (1983).Google Scholar
  7. [7]
    C. Gaibisso, G. Gambosi, M. Talamo, “A Partially Persistent Data Structure for the Set-Union Problem”, submitted to RAIRO Theoretical Informatics and Applications (1987).Google Scholar
  8. [8]
    B.A. Galler, M.J. Fischer, “An Improved Equivalence Algorithm”, Comm. ACM 7 (1964).Google Scholar
  9. [9]
    G. Gambosi, G.F. Italiano. M. Talamo, “Worst Case Analysis of the Set-Union Problem with Backtracking”, to appear on “Theoretical Computer Science” (1988).Google Scholar
  10. [10]
    J.E. Hopcroft, J.D. Ullman, “Set Merging Algorithms”, SIAM J. Comput. 2 (1973).Google Scholar
  11. [11]
    H. Mannila, E. Ukkonen, “The Set-Union Problem with Backtracking”, Proc. 13th ICALP (1986).Google Scholar
  12. [12]
    R.E. Tarjan, “Efficiency of a Good but not Linear Disjoint Set-Union Algorithm”, J. ACM 22 (1975).Google Scholar
  13. [13]
    R.E. Tarjan, “A Class of Algorithms which Require Linear Time To Maintain Disjoint Sets”, J. Computer and System Sciences 18 (1979).Google Scholar
  14. [14]
    R.E. Tarjan, “Amortized Computational Complexity”, SIAM J. Alg. Discr. Meth. 6 (1985).Google Scholar
  15. [15]
    R.E. Tarjan, J. van Leeuwen, “Worst Case Analysis of Set-Union Algorithms”, J. ACM 31 (1984).Google Scholar
  16. [16]
    J. van Leeuwen, T. van der Weide, “Alternative Path Compression Techniques”, Techn. Rep. RUU-CS-77-3, Rijksuniversiteit Utrecht, The NetherlandsGoogle Scholar
  17. [17]
    J. Westbrook, R.E. Tarjan, “Amortized Analysis of Algorithms for Set-Union with Backtracking”, Tech. Rep. TR-103-87, Dept. of Computer Sciences, Princeton University (1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Carlo Gaibisso
    • 1
  1. 1.Istituto di Analisi dei Sistemi ed Informatica del CNRRomeItaly

Personalised recommendations