1 citations · 1 across the 2 of their papers we have counts for
3 papers
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…
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…
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…