Enumeration And Generation Of Permutations With A Partially Fixed Order Of Elements
INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS(2017)
摘要
A specific class of permutations - permutations with partially fixed order of elements - has been described. A procedure of enumeration and generation of this class has been developed. Steps of the algorithm have been established to be well-defined, and its complexity has been evaluated. Some important particular classes of permutations, such as alternating and unimodal ones are special cases of the permutations described. This algorithm can be used for generating other combinatorial sets, e.g. arrangements and combinations.
更多查看译文
关键词
Enumeration and Generation of Permutations, Partially Fixed Order of Elements
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要