2 papers
cs.DS2026
Designing sparse temporal graphs satisfying connectivity requirements
Thomas Bellitto, Jules Bouton Popper, Justine Cauvi +2
Connectivity of temporal graphs has been widely studied both as graph theory and as gossip theory. In particular, it is well known that in order to connect every vertex to every ot…
cs.DM2025
Temporal Connectivity Augmentation
T. Bellitto, J. Bouton Popper, B. Escoffier
Connectivity in temporal graphs relies on the notion of temporal paths, in which edges follow a chronological order (either strict or non-strict). In this work, we investigate the…