In this paper, we study the Target Set Selection problem from a parameterized complexity perspective. Here for given graph and threshold each vertex, task is to find set of vertices (called target set) that activates whole during following iterative process. A vertex outside active becomes if number so far activated in its neighborhood at least threshold. We give two algorithms special case whe...
