An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
SIAM Journal on Computing
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
A Fast Algorithm for Enumerating Bipartite Perfect Matchings
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithms for generating convex sets in acyclic digraphs
Journal of Discrete Algorithms
File-Access Characteristics of Data-Intensive Workflow Applications
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
| Hi-index | 0.00 |
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 complexity of the algorithm for directed spanning tree is O(log2|V|) per a directed spanning tree. For a given matroid M, the algorithm for matroid bases runs in O(T/n) time per a base. Here n denotes the rank of M, and T denotes the computation time to obtain elementary circuits. Enumeration algorithms for matching problems spend O(|V|) time per a matching.