The complexity of irredundant sets parameterized by size

An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized complexity of determining whether a graph has an irredundant set of size k, where k is the parameter. The interest of this problem is that while most "k-element vertex set" problems are NP-complete, several are known to be

• Type: Journal
• Year: 2000
• Where: DAM
• Authors: Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
• Keywords: DAM 2000, Irredundant Set, Parameterized Complexity, Proper Subset