Feedback vertex sets in star graphs

Information Processing Letters

Volumn 89, Issue 4, 2004, Pages 203-208

  Wang, Fu Hsing ^a,c   Wang, Yue Li ^a   Chang, Jou Ming ^b  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL TAIPEI UNIVERSITY OF BUSINESS   (Taiwan)

^c Chungyu Institute of Technology   (Taiwan)

Author keywords

Algorithms; Analysis of algorithms; Feedback vertex sets; Interconnection networks; Star graphs

Indexed keywords

ALGORITHMS; FEEDBACK; GRAPH THEORY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

FEEDBACK VERTEX SETS; STAR GRAPHS;

DATA PROCESSING;

EID: 0346339485     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.11.001     Document Type: Article

References (15)

1. Akers S.B., Harel D., Kirshnamurthy B. The star graph: An attractive alternative to the n -cube. Proc. 1987 Internat. Conf. on Parallel Processing (ICPP'87), University Park, PA, USA. 1987;393-400.
2. Akers S.B., Kirshnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38:(4):1989;555-565.
3. Arumugam S., Kala R. Domination parameters of star graph. Ars Combin. 44:1996;93-96.
4. Bafna V., Berman P., Fujito T. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12:(3):1999;289-297.
5. Caragiannis I., Kaklamanis C., Kanellopoulos P. New bounds on the size of the minimum feedback vertex set in butterflies. Inform. Process. Lett. 83:(5):2002;275-280.
6. Focardi R., Luccio F.L., Peleg D. Feedback vertex set in hypercubes. Inform. Process. Lett. 76:(1-2):2000;1-5.
7. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, San Francisco, CA.
8. Haynes T.W., Hedetniemi S.T., Slater P.J. Fundamentals of Domination in Graphs. 1998;Marcel Dekker, New York.
9. Jwo J.S., Lakshmivarahan S., Dhall S.K. Embedding of cycles and grids in star graphs. J. Circuits Systems Comput. 1:(1):1991;43-74.
10. Liang Y.D., Chang M.S. Minimum feedback vertex set in cocomparability and convex bipartite graphs. Acta Inform. 34:(5):1997;337-346.
11. Lu C.L., Tang C.Y. A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inform. Process. Lett. 61:(2):1997;107-111.
12. Luccio F.L. Almost exact minimum feedback vertex set in meshes and butterflies. Inform. Process. Lett. 66:(2):1998;59-64.
13. Silberschatz A., Galvin P.B., Gagne G. Operating Systems Concepts. 6th edn. 2003;John Wiley and Sons, Inc. New York.
14. Shamir A. A linear time algorithm for finding minimum reducible graphs. SIAM J. Comput. 8:(4):1979;645-655.
15. Wang C., Lloyd E.L., Sofra M.L. Feedback vertex sets and cyclically reducible graphs. J. ACM. 32:(2):1985;296-313.