Unranking Small Combinations of a Large Set in Co-Lexicographic Order

The presented research is devoted to the problem of developing new combinatorial generation algorithms for combinations. In this paper, we develop a modification of Ruskey’s algorithm for unranking <i>m</i>-combinations of an <i>n</i>-set in co-lexicographic order. The proposed modification is based...

Description complète

Détails bibliographiques

Auteurs principaux:	Vladimir Kruchinin, Yuriy Shablya, Dmitry Kruchinin, Victor Rulevskiy
Format:	Artigo
Langue:	Inglês
Publié:	MDPI AG 2022-01-01
Collection:	Algorithms
Sujets:	combinatorial generation combination unranking co-lexicographic order combinatorial algorithm
Accès en ligne:	https://www.mdpi.com/1999-4893/15/2/36
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!