Skip to main content
SpringerLink
Log in

The set union problem with backtracking

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Included in the following conference series:

Abstract

The classical set union problem is to manipulate a partition of U = {1,2,...,n} under the operations find and union. We study a variant of this problem, where backtracking over the union operations is possible with the deunion operation. An implementation is developed to on-line perform an intermixed sequence of m finds, k unions and at most k deunions in O((m+k) log log n) steps. An O(k + m log n) method is also given. The problem considered is motivated by questions arising in the implementation of the programming language Prolog.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.N.Gabow and R.E.Tarjan: A linear-time algorithm for a special case of disjoint set union. Proceedings of the 15th ACM Symposium on Theory of Computing (1983), 246–251.

    Google Scholar 

  2. C.J.Hogger: Introduction to Logic Programming. Academic Press, 1984.

    Google Scholar 

  3. H.Mannila and E.Ukkonen: On the complexity of unification sequences. Third International Conference on Logic Programming, London, July 14–18, 1986, to appear.

    Google Scholar 

  4. R.E. Tarjan: Efficiency of a good but not linear disjoint set union algorithm. J.ACM 22, 2 (April 1975), 215–225.

    Google Scholar 

  5. R.E. Tarjan: A class of algorithms which require nonlinear time to maintain disjoint sets. J. Computer and System Sciences 18 (1979), 110–127.

    Google Scholar 

  6. R.E. Tarjan: Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6 (1985), 306–318.

    Google Scholar 

  7. R.E. Tarjan and J. van Leeuwen: Worst-case analysis of set union algorithms. J.ACM 31, 2 (April 1984), 245–281.

    Google Scholar 

  8. J. van Leeuwen and T. van der Weide: Alternative path compression techniques. Techn. Rep. RUU-CS-77-3, Rijksuniversiteit Utrecht, Utrecht, The Netherlands.

    Google Scholar 

  9. D.H.D. Warren and L.M. Pereira: Prolog — the language and its implementation compared with LISP. ACM SIGPLAN Notices 12, 3 (August 1977), 109–115.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki, Finland

    Heikki Mannila & Esko Ukkonen

Authors
  1. Heikki Mannila
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Esko Ukkonen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mannila, H., Ukkonen, E. (1986). The set union problem with backtracking. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_73

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_73

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation