Papers
Topics
Authors
Recent
Search
2000 character limit reached

Target Set Selection parameterized by vertex cover and more

Published 4 Dec 2018 in cs.CC, cs.DS, and cs.SI | (1812.01482v5)

Abstract: Given a simple, undirected graph GG with a threshold function τ:V(G)→N\tau:V(G) \rightarrow \mathbb{N}, the \textsc{Target Set Selection} (TSS) problem is about choosing a minimum cardinality set, say S⊆V(G)S \subseteq V(G), such that starting a diffusion process with SS as its seed set will eventually result in activating all the nodes in GG. For any non-negative integer ii, we say a set T⊆V(G)T\subseteq V(G) is a "degree-ii modulator" of GG if the degree of any vertex in the graph G−TG-T is at most ii. Degree-$0$ modulators of a graph are precisely its vertex covers. Consider a graph GG on nn vertices and mm edges. We have the following results on the TSS problem: -> It was shown by Nichterlein et al. [Social Network Analysis and Mining, 2013] that it is possible to compute an optimal-sized target set in O(2(2t+1)t⋅m)O(2^{(2^{t}+1)t}\cdot m) time, where tt denotes the cardinality of a minimum degree-$0$ modulator of GG. We improve this result by designing an algorithm running in time 2O(tlog⁡t)nO(1)2^{O(t\log t)}n^{O(1)}. -> We design a 22O(t)nO(1)2^{2^{O(t)}}n^{O(1)} time algorithm to compute an optimal target set for GG, where tt is the size of a minimum degree-$1$ modulator of GG.

Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.