Author： Pijls W. de Bruin A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.252, Iss.1, 2001-02, pp. : 197-215
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Algorithms for optimal dyadic decision trees
By Hush Don
Machine Learning, Vol. 80, Iss. 1, 2010-07 ,pp. :
Access to resources
Recommend
Parallel algorithms for red-black trees
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Alignment of trees - an alternative to tree edit
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
Algorithms for generalized vertex-rankings of partial k-trees
By Kashem M.A. Zhou X. Nishizeki T.
Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. :