We propose a new approach for speeding up enumeration algorithms.the approach does not rely on data structures deeply,instead utilizes analysis of computation time.It speeds enumeration algorithms for directed spanning trees,matroid bases,and some bipartite matching problems.We show one of these improved algorithms:one for enumerating matroid bases.for a given matroid M with m elements and rank n,an enxisting algorithm runs in O(T) time per base.We improved the time complexity to O(T),orO(T/m(m-n)).
展开▼
机译:我们提出了一种新的加速枚举算法的方法。该方法不深入依赖数据结构,而是利用对计算时间的分析。它可以加快有向生成树,拟阵基和一些二分匹配问题的枚举算法。这些改进的算法是:一种用于枚举拟阵基数的算法。对于具有m个元素且秩为n的给定拟阵M,一种算法在每个基底的O(T)时间内运行。我们将时间复杂度提高到O(T / n),或O( T / m(mn))。
展开▼