Publisher
Springer International Publishing
Reference18 articles.
1. Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger’s theorem. Netw.: Int. J. 28(3), 125–134 (1996)
2. Lecture Notes in Computer Science;S Bhadra,2003
3. Lecture Notes in Computer Science;V Campos,2020
4. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387–408 (2012)
5. Casteigts, A., Himmel, A.-S., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. In: 31st International Symposium on Algorithms and Computation, ISAAC, volume 181 of LIPIcs, pp. 30:1–30:18 (2020)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献