Random Generation of Colored Trees
Identifieur interne : 001804 ( Crin/Corpus ); précédent : 001803; suivant : 001805Random Generation of Colored Trees
Auteurs : L. Alonso ; R. SchottSource :
English descriptors
- KwdEn :
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.
Links to Exploration step
CRIN:alonso95cLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="193">Random Generation of Colored Trees</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:alonso95c</idno>
<date when="1995" year="1995">1995</date>
<idno type="wicri:Area/Crin/Corpus">001804</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Random Generation of Colored Trees</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>algorithmic</term>
<term>combinatory</term>
<term>generation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1165">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.</div>
</front>
</TEI>
<BibTex type="inproceedings"><ref>alonso95c</ref>
<crinnumber>95-R-058</crinnumber>
<category>3</category>
<equipe>AMII</equipe>
<author><e>Alonso, L.</e>
<e>Schott, R.</e>
</author>
<title>Random Generation of Colored Trees</title>
<booktitle>{Proceedings LATIN'95}</booktitle>
<year>1995</year>
<volume>911</volume>
<series>Lecture Notes in Computer Science</series>
<pages>16-35</pages>
<publisher>Springer Verlag</publisher>
<keywords><e>generation</e>
<e>combinatory</e>
<e>algorithmic</e>
</keywords>
<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.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001804 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 001804 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Corpus |type= RBID |clé= CRIN:alonso95c |texte= Random Generation of Colored Trees }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |