# A Faster Algorithm for Minimum Cycle Basis of Graphs

@inproceedings{Kavitha2004AFA,
title={A Faster Algorithm for Minimum Cycle Basis of Graphs},
author={T. Kavitha and K. Mehlhorn and D. Michail and Katarzyna E. Paluch},
booktitle={ICALP},
year={2004}
}
In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The previous best result for this problem was an O(m ω n) algorithm, where ω is the best exponent of matrix multiplication. It is presently known that ω 0, we also design a 1+e approximation algorithm to compute a cycle basis which is at most 1+e times the weight of a minimum cycle basis. The running time of this algorithm is \(O… Expand
64 Citations
An Õ(mn) Algorithm for Minimum Cycle Basis of Graphs∗
We consider the problem of computing a minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices. In this problem, a {0, 1} incidence vector is associatedExpand
An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
A simple O(m2n) randomized algorithm for the problem of computing a minimum cycle basis in an undirected graph and this algorithm almost matches the fastest known algorithm for this problem. Expand
New Approximation Algorithms for Minimum Cycle Bases of Graphs
• Mathematics, Computer Science
• STACS
• 2007
This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Θ(mω) bound, and two new algorithms to compute an approximate minimum cycle basis are presented. Expand
Algorithms to Compute Minimum Cycle Basis in Directed Graphs
• Mathematics, Computer Science
• Theory of Computing Systems
• 2006
An $\tilde{O}(m^4n)$ algorithm is presented, which is the first polynomial-time algorithm for computing a minimum cycle basis in G. Expand
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
• Mathematics, Computer Science
• STACS
• 2005
An O(m4n) algorithm is given, which is the first polynomial time algorithm for this problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. Expand
An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs
• Computer Science, Mathematics
• Algorithmica
• 2007
This work considers the problem of computing a minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices and designs an O(m2n+mn2log n) algorithm and an 1+ε approximation algorithm. Expand
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
• Mathematics, Computer Science
• ICALP
• 2006
This work considers the problem of computing a minimum cycle basis in a directed graph G whose edges have non-negative weights and presents an O(m3n + m2n2logn) algorithm, a slightly improved running time improvement of the current fastest randomized algorithm. Expand
New Approximation Algorithms for Minimum Cycle Bases of Graphs
• Mathematics, Computer Science
• Algorithmica
• 2009
This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Θ(mω) bound, and two new algorithms to compute an approximate minimum cycle basis are presented. Expand
Minimum Cycle Basis, Algorithms & Applications
• 2006
We consider the problem of computing a minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices. In this problem, a {0, 1} incidence vector is associated with each cycleExpand
Faster Randomized and Deterministic Algorithms for Minimum Cycle Bases in Directed Graphs ∗
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph isExpand