Before revision: We study a family of temporal reachability problems under waiting-time restrictions . In particular, given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, and such that the  difference in timestamps between consecutive edges is at most a resting time.
After revision: We study a family of temporal reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, and such that the difference in timestamps between consecutive edges is at most a resting time.