A polynomial-time algorithm to find the shortest cycle basis of a graph

Horton, J., D.2023-03-012023-03-011984https://unbscholar.lib.unb.ca/handle/1882/14863Define the length of a basis of a cycle space to be the sum of the lengths of all circuits in the basis. An algorithm is given that finds a basis with the shortest length in 0(e[superscript 3]v) operations. Edges may be weighted or unweighted.http://purl.org/coar/access_right/c_abf2A polynomial-time algorithm to find the shortest cycle basis of a graphtechnical reportComputer Science