Circuit Bases of Strongly Connected Digraphs

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

Publikation: Working/Discussion PaperWU Working Paper

Abstract

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)
OriginalspracheEnglisch
ErscheinungsortVienna
HerausgeberDepartment of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business
PublikationsstatusVeröffentlicht - 2001

Publikationsreihe

NamePreprint Series / Department of Applied Statistics and Data Processing
Nr.40

WU Working Paper Reihe

  • Preprint Series / Department of Applied Statistics and Data Processing

Dieses zitieren