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
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
A polynomial time algorithm for minimum cycle basis in directed graphs
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On a Special Co-cycle Basis of Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
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
Properties of Gomory-Hu co-cycle bases
Theoretical Computer Science
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
Minimum cycle bases in graphs algorithms and applications
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {–1,0,1} incidence vector is associated with each cycle and the vector space over ${\mathbb Q}$ generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in $\tilde{O}(m{^{\omega+1}}n)$ time (where ω m3n) algorithm is known for this problem. In this paper we present a simple Õ(m2n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0,1} incidence vector is associated with each cycle and the vector space over ${\mathbb F}_{2}$ generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m2n + mn2log n) time and our randomized algorithm for directed graphs almost matches this running time.