Feedback vertex set in hypercubes

Information Processing Letters

Volumn 76, Issue 1-2, 2000, Pages 1-5

  Focardi, Riccardo ^a   Luccio, Flaminia L ^c   Peleg, David ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

FEEDBACK VERTEX SETS; HYPERCUBES;

DATA REDUCTION;

EID: 0034325646     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00127-7     Document Type: Article

References (16)

1. Bar-Yehuda R., Geiger D., Naor J., Roth R.M. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. Vol. 27:(4):1998;942-959.
2. Festa P., Pardolos P.M., Resende M.G.C. Feedback set problems. AT&T Labs Research Technical Report TR 99.2.2:1999;. revised version to appear in: Encyclopedia of Optimization, Kluwer Academic Publisher, Dordrecht, Netherlands, 2000.
3. Garey M.R., Johnson D.S. Computers and Intractability. 1979;Freeman, San Francisco, CA.
4. Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. Vol. 9:1974;256-278.
5. Liang Y.D. On the feedback vertex set in permutation graphs. Inform. Process. Lett. Vol. 52:(3):1994;123-129.
6. Liang Y.D., Chang M.S. Minimum feedback vertex set in cocomparability graphs and convex bipartite graphs. Acta Inform. Vol. 34:1997;337-346.
7. Lloyd E.L., Soffa M.L. On locating minimum feedback vertex sets. J. Comput. System Sci. Vol. 37:1988;292-311.
8. Lu C., Tang C. A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inform. Process. Lett. Vol. 61:(2):1997;107-112.
9. Luccio F.L. Exact minimum feedback vertex set in meshes and butterflies. Inform. Process. Lett. Vol. 66:(2):1998;59-64.
10. MacWilliams F.J., Sloane N.J.A. The Theory of Error-Correcting Codes. 1978;North-Holland, Amsterdam.
11. Peleg D. Local majority voting, small coalitions and controlling monopolies in graphs: A review. Proc. 3rd Colloquium on Structural Information and Communication Complexity. 1996;152-169.
12. Peleg D. Size bounds for dynamic monopolies. Discrete Appl. Math. Vol. 86:(2-3):1998;263-273.
13. Peterson W.W., Weldon E.J. Error-Correcting Codes. 1972;MIT Press, Cambridge, MA.
14. Shamir A. A linear time algorithm for finding minimum cutsets in reducible graphs. SIAM J. Comput. Vol. 8:(4):1979;645-655.
15. Smith G.W., Walford R.B. The identification of a minimal feedback vertex set of a directed graph. IEEE Trans. Circuits Systems. Vol. CAS-22:(1):1975;9-14.
16. Wang C., Lloyd E.L., Soffa M.L. Feedback vertex sets and cyclically reducible graphs. J. ACM. Vol. 32:(2):1985;296-313.