Circuit Bases of Strongly Connected Digraphs

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

Circuit Bases of Strongly Connected Digraphs

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

Statistics and Mathematics

Publikation: Working/Discussion Paper › WU Working Paper

20 Downloads (Pure)

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)

Originalsprache	Englisch
Erscheinungsort	Vienna
Herausgeber	Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business
Publikationsstatus	Veröffentlicht - 2001

Publikationsreihe

Reihe	Preprint Series / Department of Applied Statistics and Data Processing
Nummer	40

WU Working Paper Reihe

Preprint Series / Department of Applied Statistics and Data Processing

Zugriff auf Dokument

DocumentEndgültige, publizierte Fassung, 277 KBLizenz: Sonstige

Verfügbarkeit prüfen

Katalog der Universitätsbibliothek

Zitat

@techreport{8d53d6da88c54bed898524c77bfe021f,

title = "Circuit Bases of Strongly Connected Digraphs",

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)",

author = "Gleiss, {Petra M.} and Josef Leydold and Stadler, {Peter F.}",

year = "2001",

language = "English",

series = "Preprint Series / Department of Applied Statistics and Data Processing",

number = "40",

publisher = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",

edition = "April 2001",

type = "WorkingPaper",

institution = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",

}

TY - UNPB

T1 - Circuit Bases of Strongly Connected Digraphs

AU - Gleiss, Petra M.

AU - Leydold, Josef

AU - Stadler, Peter F.

PY - 2001

Y1 - 2001

N2 - 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)

AB - 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)

M3 - WU Working Paper

T3 - Preprint Series / Department of Applied Statistics and Data Processing

BT - Circuit Bases of Strongly Connected Digraphs

PB - Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business

CY - Vienna

ER -