Author： Lungo A.D. Ristoro F.D. Penaud J.-G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 201-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
Mining frequent closed rooted trees
By Balcázar José Bifet Albert Lozano Antoni
Machine Learning, Vol. 78, Iss. 1-2, 2010-01 ,pp. :
Access to resources
Recommend
Efficient embeddings of ternary trees into hypercubes
By Gupta A.K. Nelson D. Wang H.
Journal of Parallel and Distributed Computing, Vol. 63, Iss. 6, 2003-06 ,pp. :
The monadic second-order logic of graphs XII: planar graphs and planar maps
By Courcelle B.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Left and Right Pathlengths in Random Binary Trees
Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. :
Non-uniform random spanning trees on weighted graphs
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :