A New Approach for Speeding Up Enumeration Algorithms

Abstract

We propose a new approach for speeding up enumeration algorithms. The approach does not relies on data structures deeply, but utilizes some analysis of its computation time. The enumeration algorithms for directed spanning trees, matroid bases, and some bipartite matching problems are speeded up by this approach. For a given graph G = (V,E), the time… (More)
DOI: 10.1007/3-540-49381-6_31

4 Figures and Tables

Topics

  • Presentations referencing similar topics