25 citations · 71 across the 20 of their papers we have counts for
Showing 2022 · cs.DMShow all
2 papers · 2 filters
cs.DM2022
Simple, strict, proper, happy: A study of reachability in temporal graphs
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that a…
cs.DM2022
Giant Components in Random Temporal Graphs
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi +4
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erdős-Rényi…