Unranking of unlabelled decomposable structures

François Bertault Paul Zimmermann 1
1 POLKA - Polynomials, Combinatorics, Arithmetic
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00098835
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:39:02 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00098835, version 1

Collections

Citation

François Bertault, Paul Zimmermann. Unranking of unlabelled decomposable structures. Troisième Conférence International sur les Ensembles Ordonnés, Algorithmes et Applications - Ordal'99, 1999, Montpellier/France, pp.12. ⟨inria-00098835⟩

Share

Metrics

Record views

96