Unranking of unlabelled decomposable structures
Identifieur interne : 002686 ( Crin/Curation ); précédent : 002685; suivant : 002687Unranking of unlabelled decomposable structures
Auteurs : François Bertault ; Paul ZimmermannSource :
English descriptors
- KwdEn :
Abstract
The generic decomposable method can be used for describing various kinds of sets of combinatorial structures, including planar and non planar general rooted trees, necklaces, integer compositions and context-free grammars. We present in this article an incremental algorithm that solves the unranking problem on sets of unlabeled decomposable structures described by using constructors Union, Product, Set and Cycle.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002686
Links to Exploration step
CRIN:bertault99bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="95">Unranking of unlabelled decomposable structures</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bertault99b</idno><date when="1999" year="1999">1999</date><idno type="wicri:Area/Crin/Corpus">002686</idno><idno type="wicri:Area/Crin/Curation">002686</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002686</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Unranking of unlabelled decomposable structures</title><author><name sortKey="Bertault, Francois" sort="Bertault, Francois" uniqKey="Bertault F" first="François" last="Bertault">François Bertault</name></author><author><name sortKey="Zimmermann, Paul" sort="Zimmermann, Paul" uniqKey="Zimmermann P" first="Paul" last="Zimmermann">Paul Zimmermann</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>decomposable structure</term><term>random generation</term><term>unranking</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1172">The generic decomposable method can be used for describing various kinds of sets of combinatorial structures, including planar and non planar general rooted trees, necklaces, integer compositions and context-free grammars. We present in this article an incremental algorithm that solves the unranking problem on sets of unlabeled decomposable structures described by using constructors Union, Product, Set and Cycle.</div></front></TEI><BibTex type="inproceedings"><ref>bertault99b</ref><crinnumber>99-R-184</crinnumber><category>3</category><author><e>Bertault, François</e><e>Zimmermann, Paul</e></author><title>Unranking of unlabelled decomposable structures</title><booktitle>{Troisième Conférence International sur les Ensembles Ordonnés, Algorithmes et Applications - Ordal'99, Montpellier, France}</booktitle><year>1999</year><month>Aug</month><keywords><e>random generation</e><e>decomposable structure</e><e>unranking</e></keywords><abstract>The generic decomposable method can be used for describing various kinds of sets of combinatorial structures, including planar and non planar general rooted trees, necklaces, integer compositions and context-free grammars. We present in this article an incremental algorithm that solves the unranking problem on sets of unlabeled decomposable structures described by using constructors Union, Product, Set and Cycle.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002686 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 002686 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:bertault99b
|texte= Unranking of unlabelled decomposable structures
}}
| This area was generated with Dilib version V0.6.33. |  |