Skip to main content
SpringerLink
Log in

Postorder hierarchy for path compressions and set union

  • Chapter 3 Algorithmics
  • Conference paper
  • First Online:
Machines, Languages, and Complexity (IMYCS 1988)

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

Included in the following conference series:

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. S. Hart, M. Sharir: Non-linearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6, 2(1986), 151–177; see also proc. 24th FOCS Symposium (1985), 313–319

    Google Scholar 

  2. M.Loebl, J.Nešetřil: Linearity and Unprovability of the set union problem strategies, STOC (1988), 360–366

    Google Scholar 

  3. M.Loebl, J.Nešetřil: (to appear)

    Google Scholar 

  4. J.M.Lucas: Postorder disjoint set union is linear, Rutgers Technical Report (September 1988)

    Google Scholar 

  5. R.E. Tarjan: Application of Path Compression on Balanced Trees, J.ACM 26 (1979), 690–715.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics (KAM), Charles University, Prague

    Martin Loebl & Jaroslav Nešetřil

Authors
  1. Martin Loebl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaroslav Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loebl, M., Nešetřil, J. (1989). Postorder hierarchy for path compressions and set union. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015935

Download citation

  • DOI: https://doi.org/10.1007/BFb0015935

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

  • Online ISBN: 978-3-540-48203-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation