arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.06062cs.DS
收藏

多集合排列的多层无环算法

Multi-level Loop-less Algorithm for Multi-set Permutations

Tadao Takaoka

摘要:

我们提出了一个算法,在O(1)的时间内产生多集排列的每一个置换,也就是说,通过一个无循环的算法,O(n)的额外内存需求。已经有几个这样的算法,产生多集排列在不同的顺序。对于多集排列,我们结合了两个无循环算法,设计在相同的原则,树遍历。我们的生成顺序不同于任何现有的顺序,算法比以前的更简单,更快。我们还将新算法应用于停车功能。

英文摘要:

We present an algorithm that generates multiset permutations in O(1) time for each permutation, that is, by a loop-less algorithm with O(n) extra memory requirement. There already exist several such algorithms that generate multiset permutations in various orders. For multiset permutations, we combine two loop-less algorithms that are designed in the same principle of tree traversal. Our order of generation is different from any existing order, and the algorithm is simpler and faster than the previous ones. We also apply the new algorithm to parking functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑