Minimal feedback vertex sets in directed split‐stars

Abstract

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