An efficient algorithm for estimating rotation distance between two binary trees

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.82, Iss.9, 2005-09, pp. : 1095-1106

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

Efficient Dynamic Embeddings of Binary Trees into Hypercubes

By Heun V. Mayr E.W.

Journal of Algorithms, Vol. 43, Iss. 1, 2002-04 ,pp. : 51-84

Academic Press

Access to resources Recommend Favorite

An Efficient Algorithm for Software Generation of Binary Linear Recurrences

By Burman Sanjay Sarkar Palash

Applicable Algebra in Engineering, Communication and Computing, Vol. 15, Iss. 3-4, 2004-11 ,pp. : 201-203

Springer Publishing Company

Access to resources Recommend Favorite

Minimal distance between two non-convex surfaces

By Gao David

Optimization, Vol. 57, Iss. 5, 2008-01 ,pp. : 705-714

Taylor & Francis Ltd

Access to resources Recommend Favorite

Distance Between Two Vertices of Maximum Matching Graphs

By Liu Yan

Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. : 641-646

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering

By Llanas Bernardo

Computational Optimization and Applications, Vol. 30, Iss. 2, 2005-02 ,pp. : 161-194

Springer Publishing Company

Access to resources Recommend Favorite