Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot. Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. Networks, 81(2):177-203, March 2023. [doi]

Abstract

Abstract is missing.