Author:
Casteigts Arnaud,Klasing Ralf,Neggaz Yessin M.,Peters Joseph G.
Funder
Agence Nationale de la Recherche
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference28 articles.
1. Aaron, E., Krizanc, D., Meyerson, E.: DMVP: Foremost waypoint coverage of time-varying graphs. In: Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014), LNCS, vol. 8747, pp 29–41. Springer (2014)
2. Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: Proceedings of the third annual ACM symposium on Principles of distributed computing (PODC), pp 278–281. ACM (1984)
3. Barjon, M., Casteigts, A., Chaumette, S., Johnen, C., Neggaz, Y.M.: Testing temporal connectivity in sparse dynamic graphs. CoRR arXiv:
1404.7634
. (A French version appeared in Proceedings of ALGOTEL 2014.) (2014)
4. Bondhugula, U., Devulapalli, A., Fernando, J., Wyckoff, P., Sadayappan, P.: Parallel FPGA-based all-pairs shortest-paths in a directed graph. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium. IEEE (2006)
5. Bournat, M., Datta, A., Dubois, S.: Self-Stabilizing Robots in Highly Dynamic Environments. In: SSS 2016 - 18th International Symposium Stabilization, Safety, and Security of Distributed Systems, LNCS, vol. 10083, pp 54–69. Springer (2016)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献