Minimum Path Bases and Relevant Paths

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

Publikation: Working/Discussion PaperWU Working Paper

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)

Publikationsreihe

NamePreprint Series / Department of Applied Statistics and Data Processing
Nr.41

WU Working Paper Reihe

  • Preprint Series / Department of Applied Statistics and Data Processing

Dieses zitieren