Minimum cycle bases: Faster and simpler

  title={Minimum cycle bases: Faster and simpler},
  author={K. Mehlhorn and D. Michail},
  journal={ACM Trans. Algorithms},
We consider the problem of computing exact or approximate minimum cycle bases of an undirected (or directed) graph <i>G</i> with <i>m</i> edges, <i>n</i> vertices and nonnegative edge weights. In this problem, a {0, 1} (−1,0,1}) incidence vector is associated with each cycle and the vector space over F<sub>2</sub> (Q) generated by these vectors is the cycle space of <i>G</i>. A set of cycles is called a cycle basis of <i>G</i> if it forms a basis for its cycle space. A cycle basis where the sum… Expand
Length bounds for cycle bases of graphs
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
Minimum Cycle Bases in Graphs Algorithms and Applications
Properties of Gomory-Hu co-cycle bases
  • T. Kavitha
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2012
Minimum cycle and homology bases of surface embedded graphs
Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time
Cycle bases in graphs characterization, algorithms, complexity, and applications
Minimum Weight Bases


A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
A greedy approach to compute a minimum cycle basis of a directed graph
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
  • Surender Baswana, T. Kavitha
  • Mathematics, Computer Science
  • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
Applications of shortest path methods