A generic approach for the unranking of labeled combinatorial classes
A generic approach for the unranking of labeled combinatorial classes
Abstract In this article, 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 labeled combinatorial classes, those that can be built using operators like unions (+), products (⋆), sequences, sets, cycles, and substitutions. …