Resource title

Circuit Bases of Strongly Connected Digraphs

Resource image

image for OpenScout resource :: Circuit Bases of Strongly Connected Digraphs

Resource description

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) ; Series: Preprint Series / Department of Applied Statistics and Data Processing

Resource author

Petra M. Gleiss, Josef Leydold, Peter F. Stadler

Resource publisher

Resource publish date

Resource language


Resource content type


Resource resource URL

Resource license

Adapt according to the license agreement. Always reference the original source and author.