A linear-time algorithm for the generation of trees
Identifieur interne : 003558 ( Istex/Corpus ); précédent : 003557; suivant : 003559A linear-time algorithm for the generation of trees
Auteurs : L. Alonso ; J. L. Rémy ; R. SchottSource :
- Algorithmica [ 0178-4617 ] ; 1997-02-01.
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
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><affiliation><mods:affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: alonso@loria.fr</mods:affiliation></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><mods:affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: remy@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name><affiliation><mods:affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: schott@loria.fr</mods:affiliation></affiliation></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></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><mods:affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: alonso@loria.fr</mods:affiliation></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><mods:affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: remy@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name><affiliation><mods:affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: schott@loria.fr</mods:affiliation></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></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><istex><corpusName>springer-journals</corpusName><author><json:item><name>L. Alonso</name><affiliations><json:string>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</json:string><json:string>E-mail: alonso@loria.fr</json:string></affiliations></json:item><json:item><name>J. L. Rémy</name><affiliations><json:string>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</json:string><json:string>E-mail: remy@loria.fr</json:string></affiliations></json:item><json:item><name>R. Schott</name><affiliations><json:string>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</json:string><json:string>E-mail: schott@loria.fr</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Coding</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Linear-time algorithm</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Random generation</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Trees</value></json:item></subject><articleId><json:string>BF02522824</json:string><json:string>Art5</json:string></articleId><arkIstex>ark:/67375/VQC-QJH80VZ6-G</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>7.624</score><pdfWordCount>8283</pdfWordCount><pdfCharCount>35775</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>21</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>52</abstractWordCount><abstractCharCount>328</abstractCharCount><keywordCount>4</keywordCount></qualityIndicators><title>A linear-time algorithm for the generation of trees</title><genre><json:string>research-article</json:string></genre><host><title>Algorithmica</title><language><json:string>unknown</json:string></language><publicationDate>1997</publicationDate><copyrightDate>1997</copyrightDate><issn><json:string>0178-4617</json:string></issn><eissn><json:string>1432-0541</json:string></eissn><journalId><json:string>453</json:string></journalId><volume>17</volume><issue>2</issue><pages><first>162</first><last>182</last></pages><genre><json:string>journal</json:string></genre><subject><json:item><value>Computer Systems Organization and Communication Networks</value></json:item><json:item><value>Data Structures, Cryptology and Information Theory</value></json:item><json:item><value>Theory of Computation</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Mathematics of Computing</value></json:item><json:item><value>Algorithms</value></json:item></subject></host><ark><json:string>ark:/67375/VQC-QJH80VZ6-G</json:string></ark><publicationDate>1997</publicationDate><copyrightDate>1997</copyrightDate><doi><json:string>10.1007/BF02522824</json:string></doi><id>E0C5AD08E214308CBAA9A932E5832EB55E89629B</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-QJH80VZ6-G/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-QJH80VZ6-G/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/VQC-QJH80VZ6-G/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A linear-time algorithm for the generation of trees</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://scientific-publisher.data.istex.fr">Springer-Verlag</publisher><pubPlace>New York</pubPlace><availability><licence><p>Springer-Verlag New York Inc., 1997</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p></availability><date>1994-09-18</date></publicationStmt><notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note><note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A linear-time algorithm for the generation of trees</title><author xml:id="author-0000"><persName><forename type="first">L.</forename><surname>Alonso</surname></persName><email>alonso@loria.fr</email><affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</affiliation></author><author xml:id="author-0001"><persName><forename type="first">J.</forename><surname>Rémy</surname></persName><email>remy@loria.fr</email><affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</affiliation></author><author xml:id="author-0002"><persName><forename type="first">R.</forename><surname>Schott</surname></persName><email>schott@loria.fr</email><affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</affiliation></author><idno type="istex">E0C5AD08E214308CBAA9A932E5832EB55E89629B</idno><idno type="ark">ark:/67375/VQC-QJH80VZ6-G</idno><idno type="DOI">10.1007/BF02522824</idno><idno type="article-id">BF02522824</idno><idno type="article-id">Art5</idno></analytic><monogr><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="pISSN">0178-4617</idno><idno type="eISSN">1432-0541</idno><idno type="journal-ID">true</idno><idno type="issue-article-count">7</idno><idno type="volume-issue-count">4</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>New York</pubPlace><date type="published" when="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></monogr></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1994-09-18</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><head>Key Words</head><item><term>Coding</term></item><item><term>Linear-time algorithm</term></item><item><term>Random generation</term></item><item><term>Trees</term></item></list></keywords></textClass><textClass><keywords scheme="Journal Subject"><list><head>Computer Science</head><item><term>Computer Systems Organization and Communication Networks</term></item><item><term>Data Structures, Cryptology and Information Theory</term></item><item><term>Theory of Computation</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Mathematics of Computing</term></item><item><term>Algorithms</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1994-09-18">Created</change><change when="1997-02-01">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-QJH80VZ6-G/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-journals not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer-Verlag</PublisherName><PublisherLocation>New York</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>453</JournalID><JournalPrintISSN>0178-4617</JournalPrintISSN><JournalElectronicISSN>1432-0541</JournalElectronicISSN><JournalTitle>Algorithmica</JournalTitle><JournalSubTitle>An International Journal in Computer Science</JournalSubTitle><JournalAbbreviatedTitle>Algorithmica</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Computer Science</JournalSubject><JournalSubject Type="Secondary">Computer Systems Organization and Communication Networks</JournalSubject><JournalSubject Type="Secondary">Data Structures, Cryptology and Information Theory</JournalSubject><JournalSubject Type="Secondary">Theory of Computation</JournalSubject><JournalSubject Type="Secondary">Algorithm Analysis and Problem Complexity</JournalSubject><JournalSubject Type="Secondary">Mathematics of Computing</JournalSubject><JournalSubject Type="Secondary">Algorithms</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo TocLevels="0" VolumeType="Regular"><VolumeIDStart>17</VolumeIDStart><VolumeIDEnd>17</VolumeIDEnd><VolumeIssueCount>4</VolumeIssueCount></VolumeInfo><Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>2</IssueIDStart><IssueIDEnd>2</IssueIDEnd><IssueArticleCount>7</IssueArticleCount><IssueHistory><CoverDate><Year>1997</Year><Month>2</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Springer-Verlag New York Inc.</CopyrightHolderName><CopyrightYear>1997</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art5"><ArticleInfo ArticleType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ArticleID>BF02522824</ArticleID><ArticleDOI>10.1007/BF02522824</ArticleDOI><ArticleSequenceNumber>5</ArticleSequenceNumber><ArticleTitle Language="En">A linear-time algorithm for the generation of trees</ArticleTitle><ArticleFirstPage>162</ArticleFirstPage><ArticleLastPage>182</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2006</Year><Month>10</Month><Day>21</Day></RegistrationDate><Received><Year>1994</Year><Month>9</Month><Day>18</Day></Received><Revised><Year>1995</Year><Month>3</Month><Day>2</Day></Revised></ArticleHistory><ArticleCopyright><CopyrightHolderName>Springer-Verlag New York Inc.</CopyrightHolderName><CopyrightYear>1997</CopyrightYear></ArticleCopyright><ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ArticleGrants><ArticleContext><JournalID>453</JournalID><VolumeIDStart>17</VolumeIDStart><VolumeIDEnd>17</VolumeIDEnd><IssueIDStart>2</IssueIDStart><IssueIDEnd>2</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>L.</GivenName><FamilyName>Alonso</FamilyName></AuthorName><Contact><Email>alonso@loria.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>J.</GivenName><GivenName>L.</GivenName><FamilyName>Rémy</FamilyName></AuthorName><Contact><Email>remy@loria.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>R.</GivenName><FamilyName>Schott</FamilyName></AuthorName><Contact><Email>schott@loria.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>CRIN, INRIA-Lorraine</OrgDivision><OrgName>Université de Nancy 1</OrgName><OrgAddress><Postcode>54506</Postcode><City>Vandoeuvre-lès-Nancy</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We present a linear algorithm which generates randomly and with uniform probability many kinds of trees: binary trees, ternary trees, arbitrary trees, forests of<Emphasis Type="Italic">p k</Emphasis>-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.</Para></Abstract><KeywordGroup Language="En"><Heading>Key Words</Heading><Keyword>Coding</Keyword><Keyword>Linear-time algorithm</Keyword><Keyword>Random generation</Keyword><Keyword>Trees</Keyword></KeywordGroup><ArticleNote Type="CommunicatedBy"><SimplePara>Communicated by C. L. Liu.</SimplePara></ArticleNote></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A linear-time algorithm for the generation of trees</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>A linear-time algorithm for the generation of trees</title></titleInfo><name type="personal"><namePart type="given">L.</namePart><namePart type="family">Alonso</namePart><affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</affiliation><affiliation>E-mail: alonso@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="given">L.</namePart><namePart type="family">Rémy</namePart><affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</affiliation><affiliation>E-mail: remy@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">R.</namePart><namePart type="family">Schott</namePart><affiliation>CRIN, INRIA-Lorraine, Université de Nancy 1, 54506, Vandoeuvre-lès-Nancy, France</affiliation><affiliation>E-mail: schott@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre><originInfo><publisher>Springer-Verlag</publisher><place><placeTerm type="text">New York</placeTerm></place><dateCreated encoding="w3cdtf">1994-09-18</dateCreated><dateIssued encoding="w3cdtf">1997-02-01</dateIssued><copyrightDate encoding="w3cdtf">1997</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract 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.</abstract><subject lang="en"><genre>Key Words</genre><topic>Coding</topic><topic>Linear-time algorithm</topic><topic>Random generation</topic><topic>Trees</topic></subject><relatedItem type="host"><titleInfo><title>Algorithmica</title><subTitle>An International Journal in Computer Science</subTitle></titleInfo><titleInfo type="abbreviated"><title>Algorithmica</title></titleInfo><genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre><originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">1997-02-01</dateIssued><copyrightDate encoding="w3cdtf">1997</copyrightDate></originInfo><subject><genre>Computer Science</genre><topic>Computer Systems Organization and Communication Networks</topic><topic>Data Structures, Cryptology and Information Theory</topic><topic>Theory of Computation</topic><topic>Algorithm Analysis and Problem Complexity</topic><topic>Mathematics of Computing</topic><topic>Algorithms</topic></subject><identifier type="ISSN">0178-4617</identifier><identifier type="eISSN">1432-0541</identifier><identifier type="JournalID">453</identifier><identifier type="IssueArticleCount">7</identifier><identifier type="VolumeIssueCount">4</identifier><part><date>1997</date><detail type="volume"><number>17</number><caption>vol.</caption></detail><detail type="issue"><number>2</number><caption>no.</caption></detail><extent unit="pages"><start>162</start><end>182</end></extent></part><recordInfo><recordOrigin>Springer-Verlag New York Inc., 1997</recordOrigin></recordInfo></relatedItem><identifier type="istex">E0C5AD08E214308CBAA9A932E5832EB55E89629B</identifier><identifier type="ark">ark:/67375/VQC-QJH80VZ6-G</identifier><identifier type="DOI">10.1007/BF02522824</identifier><identifier type="ArticleID">BF02522824</identifier><identifier type="ArticleID">Art5</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag New York Inc., 1997</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource><recordOrigin>Springer-Verlag New York Inc., 1997</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/VQC-QJH80VZ6-G/record.json</uri></json:item></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003558 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003558 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|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. |  |