activity
20172026
most citedBeing an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source

1 citations · 2 across the 19 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Minimizing Reachability Times on Temporal Graphs via Shifting Labels

Argyrios Deligkas, Eduard Eiben, George Skretas

We study how we can accelerate the spreading of information in temporal graphs via shifting operations; a problem that captures real-world applications varying from information flo…

cs.DS2021

The Complexity of Growing a Graph

George B. Mertzios, Othon Michail, George Skretas +2

We study a new algorithmic process of graph growth which starts from a single initial vertex and operates in discrete time-steps, called \emph{slots}. In every slot, the graph grow…