loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
A Distributed Algorithm for Finding Minimal Feedback Vertex Sets in Directed Split-Stars
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
Fu-Hsing Wang, Chungyu Institute of Technology, Taiwan
Cheng-Ru Hsu, Chungyu Institute of Technology, Taiwan
In 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 paper, we propose an algorithm for finding minimal feedback vertex sets of directed split-stars. Indeed, our algorithm can derive an upper bound to the size of the feedback vertex set for directed split-stars. Moreover, a simple distributed algorithm is presented for finding such sets.
Citation:
Fu-Hsing Wang, Cheng-Ru Hsu, "A Distributed Algorithm for Finding Minimal Feedback Vertex Sets in Directed Split-Stars," ispan, pp.174, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.