Minimum path bases and relevant paths
Given an undirected graph G(V, E) and a vertex subset U S; 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. Although the size distribution of subgraphs is the same in all minimum length bases, the number of cycles and paths may differ. (c) 2005 Wiley Periodicals, Inc.
cycle space minimum cycle basis relevant cycles and paths