How fast can we reach a target vertex in stochastic temporal graphs? (2019)

First Author: Akrida E.C.

Attributed to: Algorithmic Aspects of Temporal Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.4230/lipics.icalp.2019.131

Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85069178060

Type: Other

Volume: 132

Parent Publication: Leibniz International Proceedings in Informatics, LIPIcs

ISSN: 18688969