Unranking of unlabelled decomposable structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Unranking of unlabelled decomposable structures

François Bertault
  • Function : Author
  • PersonId : 756532
  • IdRef : 163755442

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.
No file

Dates and versions

inria-00098835 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098835 , version 1

Cite

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⟩
60 View
0 Download

Share

Gmail Facebook X LinkedIn More