Author:
Casteigts Arnaud,Corsini Timothée,Sarkar Writika
Publisher
Springer International Publishing
Reference30 articles.
1. Akrida, E.C., Czyzowicz, J., Gasieniec, L., Kuszner, Ł., Spirakis, P.G.: Temporal flows in temporal networks. J. Comput. Syst. Sci. 103, 46–60 (2019)
2. Akrida, E.C., Gasieniec, L., Mertzios, G.B., Spirakis, P.G.: The complexity of optimal design of temporally connected graphs. Theory Comput. Syst. 61(3), 907–944 (2017)
3. Altisen, K., Devismes, S., Durand, A., Johnen, C., Petit, F.: On implementing stabilizing leader election with weak assumptions on network dynamics. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 21–31 (2021)
4. Axiotis, K., Fotakis, D.: On the size and the approximability of minimum temporally connected subgraphs. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 149:1–149:14 (2016)
5. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31–44 (2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献