Showing cs.DSShow all
2 papers · 1 filter
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.DS2024
Canadian Traveller Problems in Temporal Graphs
Thomas Bellitto, Johanne Cohen, Bruno Escoffier +2
This paper formalises the Canadian Traveller problem as a positional two-player game on graphs. We consider two variants depending on whether an edge is blocked. In the locally-inf…