Skip to main content
SpringerLink
Log in

A class of tree-like UNION-FIND data structures and the nonlinearity

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP '81 (CAAP 1981)

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

Included in the following conference series:

  • 154 Accesses

Abstract

This paper defines a class of tree-like data structures for the UNION-FIND problem. A structure from this class is injectable in another if each tree in the latter one can be obtained as a result of some program in the former as well. By means of injection of structures the nonlinearity in this class is proved.

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. A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms", Addison-Wesley, Reading, MA, 2-nd printing, 1975, 124–139

    Google Scholar 

  2. B.W. Arden, B.A. Galler, R.M. Graham, An algorithm for equivalence declarations, Comm. ACM 4 (7) (1961) 310–344

    Google Scholar 

  3. J.E. Hopcroft, J.D. Ullman, Set merging algorithms, SIAM J. Comput. 2 (1973) 294–303

    Google Scholar 

  4. A. Kirschenbaum, R. van Slyke, Computing minimum spanning trees efficiently, Proc. 25th Annual Conf. of the ACM (1972) 518–527

    Google Scholar 

  5. D.E. Knuth, A. Schönhage, The expected linearity of a simple equivalence algorithm, Theoret. Comput. Sci. 6 (3) (1978) 281–315

    Google Scholar 

  6. M.J. Lao, A new data structure for the UNION-FIND problem, Inform. Processing Lett. 9 (1979) 39–45

    Google Scholar 

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

    Google Scholar 

  8. R.E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comp. System Sci. 2 (1979) 110–127

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, PKiN VIII p. skr. poczt. 1210, 00-901, Warszawa, Poland

    Marek J. Lao

Authors
  1. Marek J. Lao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lao, M.J. (1981). A class of tree-like UNION-FIND data structures and the nonlinearity. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-10828-9_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10828-3

  • Online ISBN: 978-3-540-38716-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation