# Implementing minimum cycle basis algorithms

@article{Mehlhorn2007ImplementingMC,
title={Implementing minimum cycle basis algorithms},
author={K. Mehlhorn and D. Michail},
journal={ACM J. Exp. Algorithmics},
year={2007},
volume={11}
}
• Published 2007
• Mathematics, Computer Science
• ACM J. Exp. Algorithmics
In this paper, we consider the problem of computing a minimum cycle basis of an undirected graph <i>G</i> = (<i>V</i>,<i>E</i>) with <i>n</i> vertices and <i>m</i> edges. We describe an efficient implementation of an <i>O</i>(<i>m</i><sup>3</sup> + <i>mn</i><sup>2</sup> log <i>n</i>) algorithm. For sparse graphs, this is the currently best-known algorithm. This algorithm's running time can be partitioned into two parts with time <i>O</i>(<i>m</i><sup>3</sup>) and <i>O</i>(<i>m</i><sup>2</sup><i… Expand
48 Citations

#### Figures, Tables, and Topics from this paper

Minimum cycle bases: Faster and simpler
• Mathematics, Computer Science
• TALG
• 2009
New Approximation Algorithms for Minimum Cycle Bases of Graphs
• Mathematics, Computer Science
• Algorithmica
• 2009
An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs
• Computer Science, Mathematics
• Algorithmica
• 2007
Rooted Cycle Bases
• Mathematics, Computer Science