On the Number of t-Ary Trees with a Given Path Length

By Seroussi Gadiel  

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 557-565

Springer Publishing Company

Access to resources Recommend Favorite

On the variance of the internal path length of generalized digital trees - The Mellin convolution approach

By Hubalek  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 143-168

Elsevier

Access to resources Recommend Favorite

On the minimal length curve that densifies the square

By Mora Gaspar   Cherruault Yves  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 28, Iss. 9, 1999-09 ,pp. : 1054-1064

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

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. : 355-399

Elsevier

Access to resources Recommend Favorite

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. : 119-143

Elsevier

Access to resources Recommend Favorite