# Resource title

Minimum Path Bases and Relevant Paths

# Resource description

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) ; Series: Preprint Series / Department of Applied Statistics and Data Processing

# Resource author

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

en

application/pdf

# Resource resource URL

http://epub.wu.ac.at/1214/1/document.pdf