Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs

Arnaud Casteigts, Timothée Corsini, Writika Sarkar. Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs. In Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernández Anta, editors, Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15-17, 2022, Proceedings. Volume 13751 of Lecture Notes in Computer Science, pages 3-18, Springer, 2022. [doi]

Abstract

Abstract is missing.