Linearity and Unprovability of Set Union Problem Strategies I. Linearity of Strong Postorder

Journal of Algorithms

Volumn 23, Issue 2, 1997, Pages 207-220

  Loebl, Martin ^a   Nešetřil, Jaroslav ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344075627     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0815     Document Type: Article

References (14)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. B. A. Galler and M. J. Fischer, An improved equivalence algorithm, Comm. ACM 7, (1964), 301-303.
3. S. Hart and M. Sharir, Non-linearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6, No. 2 (1986), 151-177.
4. J. E. Hopcroft and J. D. Ullman, Set merging algorithms, SIAM J. Comput. 2 (1973), 294-303.
5. M. Loebl and J. Nešetřil, Linearity and unprovability of the set union problem strategies, in "STOC ACM, 1988," pp. 360-366.
6. M. Loebl and J. Nešetřil, Postorder hierarchy for path compressions and set union, in "Lecture Notes in Computer Science," Vol. 381, pp. 146-151, Springer-Verlag, Berlin/ New York, 1988.
7. J. M. Lucas, Postorder disjoint set union is linear, SIAM J. Comput. 19, (1990), 868-882.
8. M. Sharir and R. Livne, On minima of functions, intersection patterns of curves and Davenport-Schinzel sequences, in "Proc. 25th FOCS Symposium, 1986," pp. 312-320.
9. M. Scharir, R. Cole, K. Kedem, D. Leven, R. Pollack, and S. Sifrony, Geometric applications of Davenport-Schinzel sequences, in "Proc. 25th FOCS Symposium, 1986," pp. 77-86.
10. R. E. Tarjan, Application of path compression on balanced trees, J. Assoc. Comput. Mech. 26 (1979), 690-715.
11. R. E. Tarjan, "Data Structures and Network Algorithms," SIAM, Philadelphia, 1983.
12. R. E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc, Comput. Mech. 22, No. 2 (1975), 215-225.
13. A. Wiernik, Planar realization of non-linear Davenport-Schinzel sequences, in "Proc. 27th IEEE Symp. on Foundations of Comp. Sci., 1986," pp. 97-106.
14. A. Buchsbaum, R. Lundar, and R. Tarjan, Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues, in "33rd IEEE Annual Symposium on Foundation of Computer Science, 1992."