Calculation of the number of complete mappings for permutations

被引：2
|
作者：
Novakovich, D [1 ]
机构：
[1] Univ N London, Res Ctr STORM, London N7 8DB, England
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2000年 / 36卷 / 02期
关键词：
complete mapping; permutation; weight of permutation;
D O I：
10.1007/BF02678671
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The computation time for counting "good" permutations rapidly grows as the length of permutations increases. The paper presents algorithms for enumeration of "good" permutations. Algorithms reducing twice the number of "good" permutations that should be counted are considered along with the algorithms employing the concept of weight of a "good" permutation.
引用
收藏
页码：244 / 247
页数：4
相关论文
共 50 条
12345