Minimum path bases and relevant paths
Copyright policy )Minimum path bases and relevant paths
AbstractGiven an undirected graph G(V,E) and a vertex subset U ⊆ 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. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(3), 119–123 2005
MSC 05C38, 05C85, Preprint Series / Department of Applied Statistics and Data Processing, graph theory / cycle space / relevant cycles and paths / minimum cycle basis, Paths and cycles
MSC 05C38, 05C85, Preprint Series / Department of Applied Statistics and Data Processing, graph theory / cycle space / relevant cycles and paths / minimum cycle basis, Paths and cycles
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!