Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Realization of Temporally Connected Graphs Based on Degree Sequences
Arnaud Casteigts, Michelle Döring, Nils Morawietz
Given an undirected graph , the problem of deciding whether admits a simple and proper time-labeling that makes it temporally connected is known to be NP-hard (Göbel et al.,…
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…