Feedback vertex sets in star graphs

Authors:
Fu-Hsing Wang;Yue-Li Wang;Jou-Ming Chang
Affiliations:
Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of China and Department of Information Management, Chung Yu Junior College of B ...;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of China;Department of Information Management, National Taipei College of Business, Taipei, Taiwan, Republic of China
Venue:
Information Processing Letters
Year:
2004

Citing 9
Cited 7

Feedback vertex sets and cyclically reducible graphs

Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
A linear-time algorithm for the weighted feedback vertex problem on interval graphs

Information Processing Letters
Almost exact minimum feedback vertex set in meshes and butterflies

Information Processing Letters
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Feedback vertex set in hypercubes

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Applied Operating System Concepts

Applied Operating System Concepts
New bounds on the size of the minimum feedback vertex set in meshes and butterflies

Information Processing Letters

New upper bounds on feedback vertex numbers in butterflies

Information Processing Letters
An efficient algorithm for minimum feedback vertex sets in rotator graphs

Information Processing Letters
Two hardness results on feedback vertex sets

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tractable feedback vertex sets in restricted bipartite graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Feedback vertex sets in rotator graphs

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
On the bounds of feedback numbers of (n,k)-star graphs

Information Processing Letters
Feedback vertex sets on restricted bipartite graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

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 paper, we propose an algorithm for finding a small feedback vertex set of a star graph. Indeed, our algorithm can derive an upper bound to the size of the feedback vertex set for star graphs. Also by applying the properties of regular graphs, a lower bound can easily be achieved for star graphs.