A polynomial-time algorithm to find the shortest cycle basis of a graph
SIAM Journal on 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
A greedy approach to compute a minimum cycle basis of a directed graph
Information Processing Letters
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Implementing minimum cycle basis algorithms
Journal of Experimental Algorithmics (JEA)
Meshing genus-1 point clouds using discrete one-forms
Computers and Graphics
Discrete Applied Mathematics
Algorithms to Compute Minimum Cycle Basis in Directed Graphs
Theory of Computing Systems
Minimum cycle bases: Faster and simpler
ACM Transactions on Algorithms (TALG)
A faster deterministic algorithm for minimum cycle bases in directed graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Hi-index | 0.00 |
In this article, we consider the problem of constructing low-weight integral cycle bases in a directed graph G = (V, E) with nonnegative edge weights. It has been shown that low-weight integral cycle bases have applications in the periodic event scheduling problem and cyclic time tabling. However, no polynomial time algorithm is known for computing a minimum weight integral cycle basis in a given directed graph. We give a necessary condition that has to be satisfied by any minimum weight integral cycle basis and guided by this necessary condition, we propose a new heuristic for constructing a low weight integral cycle basis. To the best of our knowledge, this is the first algorithm to construct integral cycle bases that are not necessarily fundamental. We implemented our heuristic and tested it on random graphs and compared the weight of the integral cycle basis computed by our algorithm with the weight of a minimum cycle basis and the weights of integral cycle bases (these are, in fact, fundamental cycle bases) computed by already existing and new heuristics for this problem. Empirical results suggest that our heuristic performs better than the existing heuristics for this problem and in fact, it computes a minimum weight integral cycle basis on these graphs. (In the above comparison, when the weight of the integral cycle basis computed and the weight of a minimum cycle basis turn out to be equal, it immediately implies that we have in fact found a minimum integral cycle basis.) The time needed for our heuristic is typically a little higher compared to the time taken by the other heuristics that compute fundamental cycle bases.