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]

@article{BrunelliCV23,
  title = {Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks},
  author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot},
  year = {2023},
  month = {March},
  doi = {10.1002/net.22123},
  url = {https://doi.org/10.1002/net.22123},
  researchr = {https://researchr.org/publication/BrunelliCV23},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {81},
  number = {2},
  pages = {177-203},
}