Cite
HARVARD Citation
Brunelli, F. et al. (2023). Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. Networks. 81 (2), pp. 177-203. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Brunelli, F. et al. (2023). Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. Networks. 81 (2), pp. 177-203. [Online].