Circuit bases of strongly connected digraphs
Petra M. Gleiss, Josef Leydold, Peter Florian Stadler · Discussiones Mathematicae Graph Theory · 2003
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined. (author's abstract)