Identifying Nearest Common Ancestors in a Distributed Environment
暂无分享，去创建一个
Stephen Alstrup | Haim Kaplan | Cyril Gavoille | Theis Rauhe | Haim Kaplan | C. Gavoille | Stephen Alstrup | Theis Rauhe
[1] Philip N. Klein,et al. A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.
[2] Alfred V. Aho,et al. Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..