|
|
|
|
|
Yuriy Shablya
Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties. In this article, we demonstrate the possibilities of using the method based on AND/O...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir Kruchinin, Yuriy Shablya, Dmitry Kruchinin and Victor Rulevskiy
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 m-combinations of an n-set in co-lexicographic order. Th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Antoine Genitrini and Martin Pépin
In the context of combinatorial sampling, the so-called ?unranking method? can be seen as a link between a total order over the objects and an effective way to construct an object of given rank. The most classical order used in this context is the lexico...
ver más
|
|
|
|
|
|