Advertisement

Postorder hierarchy for path compressions and set union

  • Martin Loebl
  • Jaroslav Nešetřil
Chapter 3 Algorithmics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 381)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /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–319Google Scholar
  2. /2/.
    M.Loebl, J.Nešetřil: Linearity and Unprovability of the set union problem strategies, STOC (1988), 360–366Google Scholar
  3. /3/.
    M.Loebl, J.Nešetřil: (to appear)Google Scholar
  4. /4/.
    J.M.Lucas: Postorder disjoint set union is linear, Rutgers Technical Report (September 1988)Google Scholar
  5. /5/.
    R.E. Tarjan: Application of Path Compression on Balanced Trees, J.ACM 26 (1979), 690–715.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Martin Loebl
    • 1
  • Jaroslav Nešetřil
    • 1
  1. 1.Department of Applied Mathematics (KAM)Charles UniversityPrague

Personalised recommendations