Computational Complexity of Temporal Reachability Dominating Sets in Temporal Graphs

Determining the minimum number of initially infected individuals required to infect the entire population in a dynamic network is a computationally hard problem, with hardness results depending on the specific temporal constraints.