A Linear Time Algorithm for the Generation of Tree
Identifieur interne : 00DC86 ( Main/Exploration ); précédent : 00DC85; suivant : 00DC87A Linear Time Algorithm for the Generation of Tree
Auteurs : L. Alonso ; J.-L. Rémy ; R. SchottSource :
English descriptors
- KwdEn :
Abstract
We present an efficient procedure for the uniform random generation of a large classe of trees including binary, k-ary, unary-binary trees, trees with n nodes and l leafs etc. The time complexity of our algorithn is O (n) where n is the number of vertices.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 000847
- to stream Crin, to step Curation: 000847
- to stream Crin, to step Checkpoint: 003C31
- to stream Main, to step Merge: 00E566
- to stream Main, to step Curation: 00DC86
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="249">A Linear Time Algorithm for the Generation of Tree</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:alonso90a</idno>
<date when="1990" year="1990">1990</date>
<idno type="wicri:Area/Crin/Corpus">000847</idno>
<idno type="wicri:Area/Crin/Curation">000847</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000847</idno>
<idno type="wicri:Area/Crin/Checkpoint">003C31</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003C31</idno>
<idno type="wicri:Area/Main/Merge">00E566</idno>
<idno type="wicri:Area/Main/Curation">00DC86</idno>
<idno type="wicri:Area/Main/Exploration">00DC86</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A Linear Time Algorithm for the Generation of Tree</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
</author>
<author><name sortKey="Remy, J L" sort="Remy, J L" uniqKey="Remy J" first="J.-L." last="Rémy">J.-L. Rémy</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>algorithm</term>
<term>generation</term>
<term>linear</term>
<term>trees</term>
<term>uniform</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="691">We present an efficient procedure for the uniform random generation of a large classe of trees including binary, k-ary, unary-binary trees, trees with n nodes and l leafs etc. The time complexity of our algorithn is O (n) where n is the number of vertices.</div>
</front>
</TEI>
<affiliations><list></list>
<tree><noCountry><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
<name sortKey="Remy, J L" sort="Remy, J L" uniqKey="Remy J" first="J.-L." last="Rémy">J.-L. Rémy</name>
<name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
</noCountry>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00DC86 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00DC86 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= CRIN:alonso90a |texte= A Linear Time Algorithm for the Generation of Tree }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |