Skip to main content
Conference Proceedings

Random generation of colored trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 911 16-35
DOI: 10.1007/3-540-59175-3_78
0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a linear time algorithm which generates uniformly a colored tree. This algorithm has numerous applications in image synthesis of plants and trees and in statistical complexity analysis. We use a one-to-one correspondence between colored trees and sequences which are then uniformly generated in linear time.

Cite

CITATION STYLE

APA

Alonso, L., & Schott, R. (1995). Random generation of colored trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 911, pp. 16–35). Springer Verlag. https://doi.org/10.1007/3-540-59175-3_78

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free