Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.35, Iss.2, 2000-05, pp. : 169-188

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Toward Optimal -Approximate Nearest Neighbor Algorithms

By Cary M.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 417-428

Elsevier

Access to resources Recommend Favorite

Efficient algorithms for finding a longest common increasing subsequence

By Chan Wun-Tat Zhang Yong Fung Stanley Ye Deshi Zhu Hong

Journal of Combinatorial Optimization, Vol. 13, Iss. 3, 2007-04 ,pp. : 277-288

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic Programming Algorithms for Generating Optimal Strip Layouts

By Cui Yaodong Huang Ling

Computational Optimization and Applications, Vol. 33, Iss. 2-3, 2006-03 ,pp. : 287-301

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

By Halperin S. Zwick U.

Journal of Algorithms, Vol. 39, Iss. 1, 2001-04 ,pp. : 1-46

Academic Press

Access to resources Recommend Favorite

Finding Uncomplemented Trees

STUDIES IN APPLIED MATHEMATICS, Vol. 51, Iss. 3, 1972-09 ,pp. : 309-310

John Wiley & Sons Inc

Access to resources Recommend Favorite