A data structure for dynamic trees
暂无分享,去创建一个
[1] Y. Shiloach. An O($n\cdot I \log^2 I$) maximum-flow algorithm , 1978 .
[2] Jeffrey D. Ullman,et al. Set Merging Algorithms , 1973, SIAM J. Comput..
[3] Robert E. Tarjan,et al. Efficient algorithms for simple matroid intersection problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[4] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[5] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[6] Amnon Naamad,et al. Network flow and generalized path compression , 1979, STOC.
[7] David Maier,et al. An Efficient Method for Storing Ancestor Information in Trees , 1979, SIAM J. Comput..
[8] Amnon Naamad,et al. An O(EVlog²V) Algorithm for the Maximal Flow Problem , 1980, J. Comput. Syst. Sci..
[9] Robert E. Tarjan,et al. Self-adjusting binary trees , 1983, STOC.
[10] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[11] Dov Harel,et al. A linear time algorithm for the lowest common ancestors problem , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[12] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[13] Zvi Galil,et al. A new algorithm for the maximal flow problem , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[14] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[15] D. Sleator. An 0 (nm log n) algorithm for maximum network flow , 1980 .
[16] Edward M. Reingold,et al. Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..
[17] Robert E. Tarjan,et al. Applications of Path Compression on Balanced Trees , 1979, JACM.
[18] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[19] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[20] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[21] A. V. Karzanov,et al. Determining the maximal flow in a network by the method of preflows , 1974 .
[22] Alfred V. Aho,et al. On finding lowest common ancestors in trees , 1973, SIAM J. Comput..
[23] Edward M. Reingold,et al. Binary search trees of bounded balance , 1972, SIAM J. Comput..
[24] Robert E. Tarjan,et al. Biased 2-3 trees , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).