T. Böhme, F. Göring, and J. Harant, Menger's Theorem, Journal of Graph Theory, vol.8, issue.1, pp.35-36, 2001.
DOI : 10.1002/jgt.1001

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, International Journal of Parallel, Emergent and Distributed Systems, vol.40, issue.1, pp.387-408, 2012.
DOI : 10.1109/COMST.2006.323440
URL : https://hal.archives-ouvertes.fr/hal-00847001

P. A. Chaintreau, J. Hui, C. Crowcroft, R. Diot, J. Gass et al., Impact of human mobility on opportunistic forwarding algorithms, TMC, vol.6, issue.6, pp.606-620, 2007.

]. D. Dol82 and . Dolev, The Byzantine generals strike again, Journal of Algorithms, vol.3, issue.1, pp.14-30, 1982.

D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and Inference Problems for Temporal Networks, Journal of Computer and System Sciences, vol.64, issue.4, pp.820-842, 2002.
DOI : 10.1006/jcss.2002.1829

L. Lamport, R. E. Shostak, and M. C. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

A. Maurer, X. Defago, and S. Tixeuil, Reliable communication in a dynamic network in the presence of byzantine faults, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00940569

M. Nesterenko and S. Tixeuil, Discovering Network Topology in the Presence of Byzantine Faults, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.12, pp.1777-1789, 2009.
DOI : 10.1109/TPDS.2009.25