Two General Methods to Reduce Delay and Change of Enumeration Algorithms
Two General Methods to Reduce Delay and Change of Enumeration Algorithms
复制标题
减少枚举算法延迟和变化的两种通用方法
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
T. Uno
中科院分区：
文献类型：
--
作者：
T. Uno
枚举和生成算法用于输出给定集的所有元素一次。有许多关于为各种问题开发算法的研究。这项研究的一个目标是得出精确的恒定时间算法，即，在任何两个连续输出之间的计算时间是恒定的。尽管许多摊销的恒定时间算法，但文献中只有很少的恒定时间算法。在本文中，我们提供了简单的方法来改进这些算法，使它们成为精确的恒定时间算法。
Enumeration and generation algorithms are for outputting all the elements of a given set just once for each. There have been numerous studies on developing algorithms for various problems. One goal of this research is to derive exact constant time algorithms, i.e., where the computation time between any two consecutive outputs is constant. Although are many amortized constant time algorithms, there are only few exact constant time algorithms in the literature. In this paper, we give simple ways to improve these algorithms so that they become exact constant time algorithms.