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}
}
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
Minimum cycle bases: Faster and simpler
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Minimum Cycle Basis, Algorithms & Applications
New Approximation Algorithms for Minimum Cycle Bases of Graphs
An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs
Cycle bases in graphs characterization, algorithms, complexity, and applications
Rooted Cycle Bases
Rooted Cycle Bases
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
Minimum cycle basis for network
  • graphs. Algorithmica,
  • 2004