Author： Auletta V. Caragiannis I. Kaklamanis C. Persiano P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 355-399
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
The permutation-path coloring problem on trees
By Corteel S. Valencia-Pabon M. Gardy D. Barth D. Denise A.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
Access to resources
Recommend
By Nagaraj S.V.
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
Machine Learning, Vol. 63, Iss. 1, 2006-04 ,pp. :
A note on binary grammatical codes of trees
By Ehrenfeucht A. ten Pas P. Rozenberg G.
Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. :