Minimal feedback vertex sets in directed split‐stars
Copyright policy )Minimal feedback vertex sets in directed split‐stars
AbstractIn a graph G = (V,E), a subset F ⊂ V(G) is a feedback vertex set of G if the subgraph induced by V(G)\F is acyclic. In this article, we propose an algorithm for finding minimal feedback vertex sets of directed split‐stars. Indeed, our algorithm can derive an upper bound on the size of the minimum feedback vertex set in directed split‐stars. Moreover, a simple distributed algorithm is presented for obtaining such sets. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45(4), 218–223 2005
distributed algorithms, Directed graphs (digraphs), tournaments, Programming involving graphs or networks, interconnection networks
distributed algorithms, Directed graphs (digraphs), tournaments, Programming involving graphs or networks, interconnection networks
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).20 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).Top 10% 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!