The complexity of irredundant sets parameterized by size
- 17 January 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 100 (3), 155-167
- https://doi.org/10.1016/s0166-218x(99)00185-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An improved fixed-parameter algorithm for vertex coverInformation Processing Letters, 1998
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- Domination and irredundance in cubic graphsDiscrete Mathematics, 1997
- The parameterized complexity of sequence alignment and consensusTheoretical Computer Science, 1995
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Beyond NP -completeness for problems of bounded width (extended abstract): hardness for the W hierarchyPublished by Association for Computing Machinery (ACM) ,1994
- The sequence of upper and lower domination, independence and irredundance numbers of a graphDiscrete Mathematics, 1993
- The irredundance number and maximum degree of a graphDiscrete Mathematics, 1984
- Contributions to the theory of domination, independence and irredundance in graphsDiscrete Mathematics, 1981