Author:
Campos Victor,Lopes Raul,Marino Andrea,Silva Ana
Publisher
Springer International Publishing
Reference25 articles.
1. Lecture Notes in Computer Science;A Casteigts,2011
2. Akrida, E.C., Czyzowicz, J., Gasieniec, L., Kuszner, L., Spirakis, P.G.: Temporal flows in temporal networks. J. Comput. Syst. Sci. 103, 46–60 (2019)
3. Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger’s theorem. Networks 28, 125–134 (1996)
4. Lecture Notes in Computer Science;S Bhadra,2003
5. Borgnat, P., Fleury, E., Guillaume, J.L., Magnien, C., Robardet, C., Scherrer, A.: Evolving networks. In: Mining Massive Data Sets for Security, pp. 198–203 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mengerian graphs: Characterization and recognition;Journal of Computer and System Sciences;2024-02
2. On Computing Optimal Temporal Branchings;Fundamentals of Computation Theory;2023
3. Edge-Disjoint Branchings in Temporal Digraphs;The Electronic Journal of Combinatorics;2021-10-08
4. Mengerian Temporal Graphs Revisited;Fundamentals of Computation Theory;2021
5. Edge-Disjoint Branchings in Temporal Graphs;Lecture Notes in Computer Science;2020