Unranking of Labelled Combinatorial Structures

Conrado Martínez () and Xavier Molinero ()
Additional contact information
Conrado Martínez: Universitat Politècnica de Catalunya, Departament de Llenguatges i Sistemes Informàtics
Xavier Molinero: Universitat Politècnica de Catalunya, Departament de Llenguatges i Sistemes Informàtics

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 288-299 from Springer

Abstract: Abstract In this paper paper we design and analyze algorithms that solve the unranking problem (i.e. generating a combinatorial structure of size n given its rank) for a large collection of labelled combinatorial classes, those that can be built using the operators +, *, Sequence, Set and Cycle. We also analyze their performance and show that the worst-case is O (n 2) (O (n log n) if the so-called boustrophedonic order is used), and provide an algebra for the analysis of the average performance together with a few examples of its application.

Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_26

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_26

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().