Minimum Path Bases and Relevant Paths

Gleiss, Petra M. and Leydold, Josef and Stadler, Peter F. (2001) Minimum Path Bases and Relevant Paths. Preprint Series / Department of Applied Statistics and Data Processing, 41. Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, Vienna.


Download (280kB)


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)

Item Type: Paper
Additional Information: published in: Networks 46(3), pp. 119-123, 2005
Keywords: graph theory / cycle space / relevant cycles and paths / minimum cycle basis
Classification Codes: MSC 05C38, 05C85
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 10 Jul 2006 11:44
Last Modified: 22 Oct 2019 00:41


View Item View Item


Downloads per month over past year

View more statistics