Unranking of labelled combinatorial structures
The authors consider algorithms that will generate an object belonging to an ordered class of labelled combinatorial structures of size \(n\) when the position of the object in the ordering is given; it is assumed that the classes are constructed from atomic classes by using the operations disjoint unions, labeled products, sequences, sets, and cycles. They show, among other things, that the worst-case time complexity for this problem is \(O(n^2)\) using lexicographic ordering, and \(O(n\log n)\) using the so-called boustrophedonic ordering. For the entire collection see [Zbl 0941.00013].
- Counting unlabeled structures
- A calculus for the random generation of labelled combinatorial structures
- A generic approach for the unranking of labeled combinatorial classes
- On Labeled and Unlabeled Combinatorial Structures
- Iterating Through Labelled Combinatorial Structures
- Mathematical Foundations of Computer Science 2003
This page was built for publication: Unranking of labelled combinatorial structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502543)
