- Tytuł:
- Circuit bases of strongly connected digraphs
- Autorzy:
-
Gleiss, Petra
Leydold, Josef
Stadler, Peter - Powiązania:
- https://bibliotekanauki.pl/articles/743155.pdf
- Data publikacji:
- 2003
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
directed graphs
cycle space
relevant circuits
minimum length basis - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2003, 23, 2; 241-260
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł