A polynomial-time algorithm to find the shortest cycle basis of a graph
SIAM Journal on Computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Minimum Cycle Bases for Network Graphs
Algorithmica
Implementing minimum cycle basis algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Cycle bases of graphs and sampled manifolds
Computer Aided Geometric Design
An improved heuristic for computing short integral cycle bases
Journal of Experimental Algorithmics (JEA)
Minimum cycle bases: Faster and simpler
ACM Transactions on Algorithms (TALG)
Minimum Cycle Bases of Weighted Outerplanar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding good cycle constraints for large scale multi-robot SLAM
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Novel topological framework for adaptive routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Minimum cycle bases of weighted outerplanar graphs
Information Processing Letters
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Hi-index | 0.00 |
In this paper, we consider the problem of computing a minimum cycle basis of an undirected graph G = (V,E) with n vertices and m edges. We describe an efficient implementation of an O(m3 + mn2 log n) algorithm. For sparse graphs, this is the currently best-known algorithm. This algorithm's running time can be partitioned into two parts with time O(m3) and O(m2n + mn2 log n), respectively. Our experimental findings imply that for random graphs the true bottleneck of a sophisticated implementation is the O(m2 n + mn2 log n) part. A straightforward implementation would require Ω(nm) shortest-path computations. Thus, we develop several heuristics in order to get a practical algorithm. Our experiments show that in random graphs our techniques result in a significant speed-up. Based on our experimental observations, we combine the two fundamentally different approaches to compute a minimum cycle basis to obtain a new hybrid algorithm with running time O(m2n2). The hybrid algorithm is very efficient, in practice, for random dense unweighted graphs. Finally, we compare these two algorithms with a number of previous implementations for finding a minimum cycle basis of an undirected graph.