How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?

Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, Viktor Zamaraev. How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

@inproceedings{AkridaMNRSZ19,
  title = {How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?},
  author = {Eleni C. Akrida and George B. Mertzios and Sotiris E. Nikoletseas and Christoforos Raptopoulos and Paul G. Spirakis and Viktor Zamaraev},
  year = {2019},
  doi = {10.4230/LIPIcs.ICALP.2019.131},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.131},
  researchr = {https://researchr.org/publication/AkridaMNRSZ19},
  cites = {0},
  citedby = {0},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece},
  editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  volume = {132},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-109-2},
}