Author： Hubalek
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.242, Iss.1, 2000-07, pp. : 143-168
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
On the Number of t-Ary Trees with a Given Path Length
Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. :
Access to resources
Recommend
Minimal path length of trees with known fringe
By De Prisco R. Parlati G. Persiano G.
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
The Variance of the height of binary search trees
By Drmota M.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Randomized path coloring on binary trees
By Auletta V. Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
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. :