Revised Greedy algorithm for formation of a minimal cycle basis of a graph
Ali Kaveh, G.R. Roosta · Communications in Numerical Methods in Engineering · 1994
Abstract An efficient algorithm is developed for the formation of a minimal cycle basis of a graph. This method reduces the number of cycles to be considered as candidates for being the elements of a minimal basis and makes practical use of the Greedy algorithm feasible. A comparison is made between the existing methods and the present algorithm. A counter‐example is presented for Kaveh's algorithm from planar graphs.