Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference57 articles.
1. DMVP: foremost waypoint coverage of time-varying graphs;Aaron,2014
2. Ephemeral networks with random availability of links: the case of fast networks;Akrida;J. Parallel Distrib. Comput.,2016
3. The complexity of optimal design of temporally connected graphs;Akrida;Theory Comput. Syst.,2017
4. How fast can we reach a target vertex in stochastic temporal graphs?;Akrida,2019
5. Temporal vertex cover with a sliding time window;Akrida;J. Comput. Syst. Sci.,2020
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献