Gleiss, Petra M.; Leydold, Josef; Stadler, Peter F. - Santa Fe Institute - 2001
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...