highly related to Spreading Processes and Gossip Theory
Temporal Graph Exploration (TEXP) is a fundamental problem where one aims to visit every vertex/edge of the temporal graph. The key question is understanding what structural properties make a graph explorable, and how quickly this exploration can be completed.
While explorability can be efficiently determined for static graphs, the problem becomes NP-complete for temporal graphs. Note that in most of the works, agents are typically allowed to wait at a vertex between moves for an unbounded amount of time.
There are two types of exploration considered in the literature:
Vertex Exploration (Hamilton, TSP)