Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22123
Abstract: In a temporal graph, each edge appears and can be traversed at specific points in time. In such a graph, temporal reachability of one node from another is naturally captured by the existence of a… read more here.
Keywords: maximizing reachability; trip temporalization; temporal graph; reachability ... See more keywords