New bounds on the size of the minimum feedback vertex set in meshes and butterflies

Information Processing Letters

Volumn 83, Issue 5, 2002, Pages 275-280

  Caragiannis, Ioannis ^a   Kaklamanis, Christos ^a   Kanellopoulos, Panagiotis ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Algorithms; Feedback vertex set; Interconnection networks

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; GRAPH THEORY; OPTIMIZATION; SET THEORY; THEOREM PROVING;

FEEDBACK VERTEX SETS;

INTERCONNECTION NETWORKS;

EID: 0037105931     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00266-1     Document Type: Article

References (13)

1. A 2-approximation algorithm for the undirected feedback vertex set problem
2. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
3. Feedback vertex set in hypercubes
4. Wavelength conversion in optical networks
5. Minimum feedback vertex set in comparability graphs and convex bipartite graphs
6. A linear-time algorithm for the weighted feedback vertex problem on interval graphs
7. Almost exact minimum feedback vertex set in meshes and butterflies
8. Local majority voting, small coalitions and controlling monopolies in graphs: A review
9. A linear time algorithm for finding minimum cutsets in reducible graphs
10. Placement de convertisseurs de longueurs d'ondes dans les réseaux optiques
11. Feedback vertex sets and cyclically reducible graphs