Circuit Bases of Strongly Connected Digraphs
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.
Year of publication: |
2001-10
|
---|---|
Authors: | Gleiss, Petra M. ; Leydold, Josef ; Stadler, Peter F. |
Institutions: | Santa Fe Institute |
Subject: | Strongly connected digraphs | cycle space | minimum circuit basis |
Saved in:
Saved in favorites
Similar items by person
-
Interchangeability of Relevant Cycles in Graphs
Gleiss, Petra M., (1999)
-
Relevant Cycles in Biopolymers and Random Graphs
Gleiss, Petra M., (1999)
-
Gleiss, Petra M., (2000)
- More ...