Corpus ID: 173739039

Minimum Cycle Basis, Algorithms & Applications

  title={Minimum Cycle Basis, Algorithms \& Applications},
  author={D. Michail and M. Bl{\"a}ser and K. Mehlhorn},
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 cycle and the vector space over F2 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 of its cycle space. A cycle basis where the sum of the weights of its cycles is minimum is called a minimum cycle basis of G. Minimum cycle bases are… Expand
Building hamiltonian networks using the cycles laplacian of the underlying graph
  • Cristian E. Onete, M. Onete
  • Mathematics, Computer Science
  • 2015 IEEE International Symposium on Circuits and Systems (ISCAS)
  • 2015
Finding ground traces using the laplacian of the meshes of the associated graph
Evolutionary Algorithms and Matroid Optimization Problems
Evolutionary algorithms and matroid optimization problems


An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
A Faster Algorithm for Minimum Cycle Basis of Graphs
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
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
Minimum Cycle Bases for Network Graphs
Minimum Path Bases
When Do Short Cycles Generate the Cycle Space?
Algorithms for Generating Fundamental Cycles in a Graph