ScholarLens Back to search
2005•NetworksRequires access

Minimal feedback vertex sets in directed split‐stars

Fu–Hsing Wang, Cheng‐Ju Hsu, Jen‐Chih Tsai

Open publisher page 21 citations

Abstract

Abstract 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 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

About this research paper

What this paper is about

Abstract 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 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

Why it matters

OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract 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 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

Key concepts: Feedback vertex set, Vertex (graph theory), Feedback arc set, Vertex connectivity, Stars, Combinatorics, Graph, Upper and lower bounds

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Minimal feedback vertex sets in directed split‐stars — Research Paper | ScholarLens