Robert Endre Tarjan
- 1 ACKERMANNN, W Zum Hdbershen Aufbau der reellen Zahlen. Math. Ann 99 (1928), 118-133Google Scholar
- 2 Aao, A.V, HOPCROFr, J.E., A~D Ut&MAN, J.D The Design and Analysts of Computer Algorithms. Addison- Wesley, Reading, Mass., 1974 Google Scholar
- 3 AHO, A.V, HOPCROFT, J.E, AND ULLMAN, J.D On computing least common ancestors in trees SIAM J. Comptng. 5 (1976), 115-132.Google Scholar
- 4 Auo, A V., AtqD UtJ~tAN, J D. Node listings for reducible flow graphs. J Comptr Syst Sci. 13 (1976), 286- 299Google Scholar
- 5 ARDEN, B.W., GXLLER, B A., AND GRAHAM, R.M. An algorithm for equivalence declarauons. Comm. A CM 4, 7 (July 1961), 310-314 Google Scholar
- 6 CHERITON, D, AND TARJAN, R E Fmdmg minimum spannmg trees SIAM J Comptng. 5 (1976), 724-742Google Scholar
- 7 CmN, FY, AND HOUCK, D J Algorithms for updating minimal spanning trees. J. Comptr Syst Sci 16 (1978), 333-344Google Scholar
- 8 CHV.~TAL, V., KLARNER, D.A., AND KNUTH, D E Selected combinatorial research problems STAN-CS-72-Google Scholar
- 9 FARROW, R Efficlent on-line evaluation of funcUons defined on paths m trees. Tech. Re~. 476-093-17, Dept 292, Comptr Sc~ Dept, Stanford U, Stanford, Cahf, 1972 Math Sc~, R~ce U, Houston, Tex, 1977Google Scholar
- 10 FISCHER, M J. Efficiency of eqmvalence algorithms. In Complexity of Computauons, R E Miller and J W Thatcher, Eds, Plenum Press, New York, 1972, pp 153-168Google Scholar
- 11 FONG, A., KAM, J, AND ULLMAN, J D Application of latuce algebra to loop optimization. Conf. Rec Second ACM Symp. Pnnc~ples of Programming Languages, Palo Alto, Cahf., 1975, pp 1-9 Google Scholar
- 12 GALLER, B A., AND FISCHER, M J An improved equivalence algorithm Comm. ACM 7, 5 (May 1964), 301- 303. Google Scholar
- 13 GRAHAM, S L, AND WEGMAN, M A fast and usually linear algorithm for global flow analysts. J. A CM 23, 1 (Jan 1976), 172-202 Google Scholar
- 14 HOPCROFT, J E Private commumcatlon.Google Scholar
- 15 HOPCROFT, J E., AND ULLMAN, J D Set-merging algonthms. SIAM J Comptng 2 (1973), 294-303Google Scholar
- 16 Hu,T C Integer Programming and Network Flows. Addison-Wesley, Reading, Mass., 1969, pp 129-150.Google Scholar
- 17 KENNEDY, K.W Node hstmgs applied to data flow analysis Conf Rec. Second ACM Syrup Pnnclples of Programming Languages, Palo Alto, Cahf, 1975, pp 10-21. Google Scholar
- 18 KNUTH, D E The Art of Computer Programming, Vol I. Fundamental Algoruhms, Addison-Wesley, Reading, Mass., 1968 Google Scholar
- 19 LENGAUER, T., AND TARJAN, R E A fast algonthm for finding dominators m a flow graph. To appear m A CM Tram Programming Languages and Syst. Google Scholar
- 20 PATERSON, M Unpubhshed report, U. of Warwick, Conventry, England, 1972.Google Scholar
- 21 TARJAN, R.E Depth-first search and hnear graph algorithms SlAM Z Comptng. 1 (1972), 146-160.Google Scholar
- 22 TAR/AN, R.E Finding dominators m directed~raphs. SlAM J. Comptng 5 (1974), 62-89.Google Scholar
- 23 TARJAN, R.E. Testing flow graph reduclbdlty J Comptr and Syst. Scz 9 (1974), 355-365Google Scholar
- 24 TAR/AN, R E Efficiency of a good but not linear set union algorithm J. ACM 22, 2 (April 1975), 215-225. Google Scholar
- 25 TAR/AN, R E. Apphcat~ons of path compression on balanced trees Tech Rep. STAN-CS-75-512, Comptr. Sc~ Dept, Stanford U, Stanford, Cahf., 1975 Google Scholar
- 26 TAR/AN, R.E Solving path problems on &rected graphs Tech Rep STAN-CS-75-528, Comptr. Set. Dept, Stanford U, Stanford, Cahf, 1975 Google Scholar
- 27 TAt~Ar~, R.E. Graph theory and Gaussmn elLmmaUon In Sparse Matrix Computatwns, J R. Bunch and D.J. Rose, Eds., Academic Press, New York, 1976, pp. 3-22Google Scholar
- 28 TAR/AN, R E A class of algorithms which reqmre non-hnear tune to maintain disjoint sets TO appear in J. Comptr and Syst. SclGoogle Scholar
- 29 TAR/AN, R.E ComplexRy of monotone networks for computing conjunctions Annals Discrete Math. 2 (1978), 121-133Google Scholar
- 30 ULLMAN, J.D. A fast algonthm for the ehmmation of common subexpresstons. Aeta Informatwa 2 (1973), 191-213.Google Scholar
- 31 YAO, A.C. An O({EI log log I VI) algonthm for finding minimum spanning trees. Inform. Processing Letters 4 (1975), 21-23Google Scholar
Index Terms
- Applications of Path Compression on Balanced Trees
Recommendations
Rank-Balanced Trees
Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the ...
Delay-Constrained Minimum Shortest Path Trees and Related Problems
Combinatorial Optimization and ApplicationsAbstractMotivated by applications in communication networks of the diameter-constrained minimum spanning tree problem, we consider the delay-constrained minimum shortest path tree (DcMSPT) problem. Specifically, given a weighted graph and a ...
Path Length of Binary Search Trees
An algorithm is given for constructing a binary tree of minimum weighted path length and with restricted maximum path length. (Huffman’s tree is a binary tree of minimum weighted path length with no restriction on maximum path length.) When an ...
Comments