1 citations · 1 across the 3 of their papers we have counts for
4 papers
Zero Forcing Sets in Temporal Graphs
Julien Baste, Simon Dreyer, Clara Marcille +2
The Zero Forcing (or corruption) of a graph is the problem of finding a minimum-size ``corrupting'' set. It corresponds to a subset of its vertices that can corrupt the whole graph…
How to Color Temporal Graphs to Ensure Proper Transitions
Allen Ibiapina, Minh Hang Nguyen, Mikaël Rabie +1
Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we ne…
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…
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
Mónika Csikós, Michel Habib, Minh-Hang Nguyen +2
In this paper, we study temporal graphs arising from mobility models, where vertices correspond to agents moving in space and edges appear each time two agents meet. We propose a r…