Author:
Casteigts Arnaud,Peters Joseph G.,Schoeters Jason
Funder
Agence nationale de la recherche
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. Data Structures and Algorithms;Aho,1983
2. The complexity of optimal design of temporally connected graphs;Akrida;Theory Comput. Syst.,2017
3. Dynamic algorithms for geometric spanners of small diameter: randomized solutions;Arya;Comput. Geom.,1999
4. Efficient and reliable broadcast is achievable in an eventually connected network;Awerbuch,1984
5. On the size and the approximability of minimum temporally connected subgraphs;Axiotis,2016
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The complexity of computing optimum labelings for temporal connectivity;Journal of Computer and System Sciences;2024-12
2. Temporally connected components;Theoretical Computer Science;2024-10
3. A new temporal interpretation of cluster editing;Journal of Computer and System Sciences;2024-09
4. Temporal reachability minimization: Delaying vs. deleting;Journal of Computer and System Sciences;2024-09
5. Blackout-tolerant temporal spanners;Journal of Computer and System Sciences;2024-05