Sciweavers

DAM
2000
101views more  DAM 2000»
13 years 11 months ago
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 co...
Rodney G. Downey, Michael R. Fellows, Venkatesh Ra...