# New Approximation Algorithms for Minimum Cycle Bases of Graphs

@article{Kavitha2009NewAA,
title={New Approximation Algorithms for Minimum Cycle Bases of Graphs},
author={T. Kavitha and K. Mehlhorn and D. Michail},
journal={Algorithmica},
year={2009},
volume={59},
pages={471-488}
}
• Published 2009
• Mathematics, Computer Science
• Algorithmica
AbstractWe consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. 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 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… Expand
An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs
• Computer Science, Mathematics
• Algorithmica
• 2007
Minimum cycle bases: Faster and simpler
• Mathematics, Computer Science
• TALG
• 2009
New length bounds for cycle bases
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2007
Convex cycle bases
• Mathematics, Computer Science
• Ars Math. Contemp.
• 2014

#### References

SHOWING 1-10 OF 59 REFERENCES
Algorithms to Compute Minimum Cycle Basis in Directed Graphs
• Mathematics, Computer Science
• Theory of Computing Systems
• 2006
An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs
• Computer Science, Mathematics
• Algorithmica
• 2007
A Faster Algorithm for Minimum Cycle Basis of Graphs
• Computer Science, Mathematics
• ICALP
• 2004
When Do Short Cycles Generate the Cycle Space?
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1993
Minimum Cycle Bases for Network Graphs
• Mathematics, Computer Science
• Algorithmica
• 2004