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
Journal of Experimental Algorithmics (JEA)
Meshing genus-1 point clouds using discrete one-forms
Computers and Graphics
New approximation algorithms for minimum cycle bases of graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Minimum cycle bases and surface reconstruction
GD'05 Proceedings of the 13th international conference on Graph Drawing
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 + mn2log n) algorithm presented in [1]. 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 the true bottleneck of a sophisticated implementation is the O( m2n + 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 speedup. Based on our experimental observations, we combine the two fundamentally different approaches to compute a minimum cycle basis used in [1,2] and [3,4], 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 in an undirected graph.