An (O)over-tilde (m(2)n) Algorithm for Minimum Cycle Basis of Graphs (2008)
Kavitha, Telikepalli, Mehlhorn, Kurt, Michail, Dimitrios, Paluch, Katarzyna E
We consider the problem of computing a minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices. In this problem, a {0,1} incidence vector is associated...
An Õ(m2 n) algorithm for Minimum Cycle Basis of graphs ∗ (2008)
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
We consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The input to this problem is an undirected graph whose edges have non-negative weights. In this...