@techreport{c735b622ab764d038f7296a4c28bbf17,
title = "Minimum Path Bases and Relevant Paths",
abstract = "Given an undirected graph G(V,E) and a vertex subset U\subseteq V the U-space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U-space. (author's abstract)",
author = "Gleiss, {Petra M.} and Josef Leydold and Stadler, {Peter F.}",
year = "2001",
doi = "10.1002/net.20080",
language = "English",
series = "Preprint Series / Department of Applied Statistics and Data Processing",
number = "41",
publisher = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",
edition = "May 2001",
type = "WorkingPaper",
institution = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",
}