Getting back to the past in the union-find problem

  • Giorgio Gambosi
  • Giuseppe F. Italiano
  • Maurizio Talamo
Contributed Papers Algorithms

DOI: 10.1007/BFb0035827

Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)
Cite this paper as:
Gambosi G., Italiano G.F., Talamo M. (1988) Getting back to the past in the union-find problem. In: Cori R., Wirsing M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg

Abstract

We consider an extension of the well known set union problem, where backtracking over the union operations is possible. A data structure is presented which maintains a partition of an n-item set and performs each union in O(loglogn) time, each find in O(logn) time and allows backtracking over the unions in O(1) time. The space complexity is O(n). The data structure favorably compares with other data structures proposed in the literature for such a problem also from the space × time complexity point of view.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Giorgio Gambosi
    • 1
  • Giuseppe F. Italiano
    • 2
  • Maurizio Talamo
    • 1
  1. 1.Istituto di Analisi dei Sistemi ed Informatica del C.N.R.RomeItaly
  2. 2.Dipartimento di Informatica e SistemisticaUniversità di Roma "La Sapienza’`RomeItaly

Personalised recommendations