@techreport{f7e2528247574e969309fd7bc3f4fe91,
title = "Interchangeability of Relevant Cycles in Graphs",
abstract = "The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of other cycles in W and shorter cycles. It is shown that each minimum cycle basis contains the same number of representatives of a given class W. This result is used to derive upper and lower bounds on the number of distinct minimum cycle bases. Finally, we give a polynomial-time algorithm to compute this partition. (author's abstract)",
author = "Gleiss, {Petra M.} and Josef Leydold and Stadler, {Peter F.}",
year = "1999",
language = "English",
series = "Preprint Series / Department of Applied Statistics and Data Processing",
number = "27",
publisher = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",
edition = "July 199",
type = "WorkingPaper",
institution = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",
}