Publisher
Springer Berlin Heidelberg
Reference8 articles.
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
2. B.W. Arden, B.A. Galler, R.M. Graham, An algorithm for equivalence declarations, Comm. ACM 4 (7) (1961) 310–344
3. J.E. Hopcroft, J.D. Ullman, Set merging algorithms, SIAM J. Comput. 2 (1973) 294–303
4. A. Kirschenbaum, R. van Slyke, Computing minimum spanning trees efficiently, Proc. 25th Annual Conf. of the ACM (1972) 518–527
5. D.E. Knuth, A. Schönhage, The expected linearity of a simple equivalence algorithm, Theoret. Comput. Sci. 6 (3) (1978) 281–315