Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Latency-Bounded Target Set Selection in Social Networks
verfasst von : Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Ugo Vaccaro
Erschienen in: The Nature of Computation. Logic, Algorithms, Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study variants of the Target Set Selection problem, first proposed by Kempe
et al
. In our scenario one is given a graph
G
= (
V
,
E
), integer values
t
(
v
) for each vertex
v
, and the objective is to determine a small set of vertices (
target set
) that activates a given number (or a given subset) of vertices of
G
within
a prescribed number of rounds. The activation process in
G
proceeds as follows: initially, at round 0, all vertices in the target set are activated; subsequently at each round
r
≥ 1 every vertex of
G
becomes activated if at least
t
(
v
) of its neighbors are active by round
r
− 1. It is known that the problem of finding a minimum cardinality Target Set that eventually activates the whole graph
G
is hard to approximate to a factor better than
$O(2^{\log^{1-\epsilon }|V|})$
. In this paper we give
exact
polynomial time algorithms to find minimum cardinality Target Sets in graphs of bounded clique-width, and
exact
linear time algorithms for trees.