Almost exact minimum feedback vertex set in meshes and butterflies

Information Processing Letters

Volumn 66, Issue 2, 1998, Pages 59-64

  Luccio, Flaminia L ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Algorithms; Butterfly; Combinatorial problems; Exact bounds; Feedback vertex set; Mesh

Indexed keywords

ALGORITHMS; INTERCONNECTION NETWORKS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

FEEDBACK VERTEX SET;

GRAPH THEORY;

EID: 0032049851     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00039-8     Document Type: Article

References (8)

1. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, CA, 1979.
2. Y.D. Liang, On the feedback vertex set in permutation graphs, Inform. Process. Lett. 52 (3) (1994) 123-129.
3. Y.D. Liang, M.S. Chang, Minimum feedback vertex set in cocomparability graphs and convex bipartite graphs. Acta Inform. 34 (1997) 337-346.
4. E.L. Llyod, M.L. Soffa, On locating minimum feedback vertex sets, J. Comput. System Sci. 37 (1988) 292-311.
5. C. Lu, C. Tang, A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inform. Process. Lett. 61 (2) (1997) 107-112.
6. D. Peleg, Local majority voting, small coalitions and controlling monopolies in graphs: A review, in: Proc. 3rd Colloquium on Structural Information and Communication Complexity, 1996, pp. 152-169.
7. D. Peleg, Size bounds for dynamic monopolies, in: Proc. 4th Colloquium on Structural Information and Communication Complexity, Carleton Univ. Press, Ottawa, 1997, pp. 165-175.
8. J.D. Ullman, Computational Aspects of VLSI (Computer Science Press. Rockville, MD, 1984).