A Faster Deterministic Algorithm for Minimum Cycle Basis in Directed Graphs (2008)
Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn, Kavitha Kurt Mehlhorn
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is...