Showing 2024Show all
2 papers · 1 filter
cs.CC2024
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs
Arnaud Casteigts, Nils Morawietz, Petra Wolf
A temporal graph is a graph whose edges only appear at certain points in time. Reachability in these graphs is defined in terms of paths that traverse the edges in chronological or…
cs.DS2024
Freeze-Tag in has Wake-up Time Five
Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille +1
The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of robots, starting from a single active robot. In the basic geometric version, every…