The complexity of irredundant sets parameterized by size

Discrete Applied Mathematics

Volumn 100, Issue 3, 2000, Pages 155-167

  Downey, Rodney G ^a   Fellows, Michael R ^b   Raman, Venkatesh ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF VICTORIA   (Canada)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Irredundant sets; Parameterized complexity

Indexed keywords

EID: 0010848069     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00185-7     Document Type: Article

References (20)

1. Balasubramanian R., Fellows M., Raman V. An improved fixed-parameter algorithm for vertex cover. Inform. Process. Lett. 65:1998;163-168.
2. Bodlaender H., Downey R., Fellows M., Wareham H.T. The parameterized complexity of the longest common subsequence problem. Theoret. Comput. Sci. A. 147:1995;31-54.
3. H. Bodlaender, M.R. Fellows, M.T. Hallett, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, Proceedings of the ACM Symposium on Theory of Computing (STOC), 1994, pp. 449-458.
4. Bollobás B., Cockayne E.J. The irredundance number and maximum degree of a graph. Discrete Math. 49:1984;197-199.
5. L. Cai, J. Chen, R.G. Downey, M.R. Fellows, On the parameterized complexity of short computation and factorization, Arch. Math. Logic, to appear.
6. E.J. Cockayne, P.J.P. Grobler, S.T. Hedetniemi, A.A. McRae, What makes an irredundant set maximal?, J. Comb. Math. Comb. Comput., to appear.
7. Cockayne E.J., Mynhardt C.M. The sequence of upper and lower domination, independence and irredundance numbers of a graph. Discrete Math. 122:1993;89-102.
8. Cockayne E.J., Mynhardt C.M. Domination and irredundance in cubic graphs. Discrete Math. 167-168:1997;205-214.
9. E.J. Cockayne, C.M. Mynhardt, Domination-related parameters, in: Haynes, Hedetniemi, Slater (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
10. Cockayne E.J., Thomason A., Payan C., Favaron O. Contributions to the theory of domination, independence and irredundance in graphs. Discrete Math. 33:1981;249-258.
11. Downey R.G., Fellows M.R. Fixed-parameter tractability and completeness. Congr. Numer. 87:1992;161-187.
12. Downey R.G., Fellows M.R. Fixed parameter tractability and completeness I: basic theory. SIAM J. Comput. 24:1995;873-921.
13. Downey R.G., Fellows M.R. Fixed parameter tractability and completeness II: completeness for W[1]. Theoret. Comput. Sci. A. 141:1995;109-131.
14. R.G. Downey, M.R. Fellows, Parametrized computational feasibility, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhauser, Boston, 1995, pp. 219-244.
15. R.G. Downey, M. Fellows, B. Kapron, M. Hallett, H.T. Wareham, The parameterized complexity of some problems in logic and linguistics, Proceedings Symposium on Logical Foundations of Computer Science (LFCS), Springer, Berlin, Lecture Notes in Computer Science, Vol. 813, 1994, pp. 89-100.
16. R.G. Downey, M. Fellows, K. Regan, Threshold dominating sets and an improved characterization of W[2] , Theoret. Comput. Sci. A, to appear.
17. Fellows M., Fricke G., Hedetniemi S., Jacobs D. The private neighbor cube. SIAM J. Discrete Math. 7:1994;41-47.
18. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
19. Hedetniemi S.T., Laskar R., Pfaff J. Irredundance in graphs: a survey. Congr. Numer. 48:1985;183-193.
20. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover - further improved, Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS), March 4-6 (1999) Lecture Notes in Computer Science, Trier, Germany, Springer, Berlin.