Methods of Constructing Argument of Objective Function in Combinatorial Optimization Problems
Cybernetics and Systems Analysis
Some Inequalities Concerning Cross-Intersecting Families
Combinatorics, Probability and Computing
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Description and generation of permutations containing cycles
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
It is proved that combinatorial configurations formed by a recurrent combinatorial access statement (combinations with repetition and without repetition, permutation with repetition and without repetition, binary sequences, simple marked graphs) are generated by one and the same algorithm or by its modification.