Return to search

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. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

Identiferoai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_9ed
Date January 2001
CreatorsGleiss, Petra M., Leydold, Josef, Stadler, Peter F.
PublisherDepartment of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business
Source SetsWirtschaftsuniversität Wien
LanguageEnglish
Detected LanguageEnglish
TypeWorking Paper, NonPeerReviewed
Formatapplication/pdf
Relationhttp://epub.wu.ac.at/178/

Page generated in 0.0017 seconds