A linear-time algorithm for the generation of trees
Identifieur interne : 002817 ( Istex/Checkpoint ); précédent : 002816; suivant : 002818A linear-time algorithm for the generation of trees
Auteurs : L. Alonso [France] ; J. L. Rémy [France] ; R. Schott [France]Source :
- Algorithmica [ 0178-4617 ] ; 1997-02-01.
Descripteurs français
- Wicri :
- topic : Codage.
English descriptors
- KwdEn :
Abstract
Abstract: We present a linear algorithm which generates randomly and with uniform probability many kinds of trees: binary trees, ternary trees, arbitrary trees, forests ofp k-ary trees,.... The algorithm is based on the definition of generic trees which can be coded as words. These words, in turn, are generated in linear time.
Url:
DOI: 10.1007/BF02522824
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:E0C5AD08E214308CBAA9A932E5832EB55E89629BLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A linear-time algorithm for the generation of trees</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>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:E0C5AD08E214308CBAA9A932E5832EB55E89629B</idno>
<date when="1997" year="1997">1997</date>
<idno type="doi">10.1007/BF02522824</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-QJH80VZ6-G/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003558</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003558</idno>
<idno type="wicri:Area/Istex/Curation">003516</idno>
<idno type="wicri:Area/Istex/Checkpoint">002817</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002817</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A linear-time algorithm for the generation of trees</title>
<author><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</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>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Algorithmica</title>
<title level="j" type="sub">An International Journal in Computer Science</title>
<title level="j" type="abbrev">Algorithmica</title>
<idno type="ISSN">0178-4617</idno>
<idno type="eISSN">1432-0541</idno>
<imprint><publisher>Springer-Verlag</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1997-02-01">1997-02-01</date>
<biblScope unit="volume">17</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="page" from="162">162</biblScope>
<biblScope unit="page" to="182">182</biblScope>
</imprint>
<idno type="ISSN">0178-4617</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0178-4617</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Coding</term>
<term>Linear-time algorithm</term>
<term>Random generation</term>
<term>Trees</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Codage</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We present a linear algorithm which generates randomly and with uniform probability many kinds of trees: binary trees, ternary trees, arbitrary trees, forests ofp k-ary trees,.... The algorithm is based on the definition of generic trees which can be coded as words. These words, in turn, are generated in linear time.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Alonso, L" sort="Alonso, L" uniqKey="Alonso L" first="L." last="Alonso">L. Alonso</name>
</region>
<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="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>
<name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002817 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 002817 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:E0C5AD08E214308CBAA9A932E5832EB55E89629B |texte= A linear-time algorithm for the generation of trees }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |