“…This requirement makes temporal reachability non-symmetric and non-transitive, which stands in contrast to reachability in normal (static) graphs. Reachability is arguably one of the most central concepts in temporal graph algorithmics and has been studied under various aspects, such as path finding [5,9,12,40], vertex separation [28,34,41], finding spanning subgraphs [4,11], temporal graph exploration [2,7,23,24,25,26], and others [3,10,32,35].…”