Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source

Research output: Contribution to journal › Article › peer-review

Original language	English
Article number	105171
Number of pages	19
Journal	Information and Computation
Volume	299
Early online date	22 May 2024
DOIs	https://doi.org/10.1016/j.ic.2024.105171
Publication status	Published - Aug 2024

Access to Document

Accepted manuscript
Accepted author manuscript, 796 KB
Licence: CC BY-NC-ND
Embargo ends: 22/05/26

@article{b09a446d1ca84bd29701a726b6347015,

title = "Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source",

author = "Argyrios Deligkas and Michelle D{\"o}ring and Eduard Eiben and Tiger-Lily Goldsmith and George Skretas",

year = "2024",

month = aug,

doi = "10.1016/j.ic.2024.105171",

language = "English",

volume = "299",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Being an influencer is hard

T2 - The complexity of influence maximization in temporal graphs with a fixed source

AU - Deligkas, Argyrios

AU - Döring, Michelle

AU - Eiben, Eduard

AU - Goldsmith, Tiger-Lily

AU - Skretas, George

PY - 2024/8

Y1 - 2024/8

U2 - 10.1016/j.ic.2024.105171

DO - 10.1016/j.ic.2024.105171

M3 - Article

SN - 0890-5401

VL - 299

JO - Information and Computation

JF - Information and Computation

M1 - 105171

ER -