SOARES , Ronan

Graph searching games involve a team of searchers that aims at capturing a fugitive in a graph. These games have been widely studied for their relationships with tree- and path-decomposition of graphs. In order to define decompositions for directed graphs, similar games have been proposed in directed graphs. In this paper, we consider such a...

Graph searching games involve a team of searchers that aims at capturing a fugitive in a graph. These games have been widely studied for their relationships with treeand path-decomposition of graphs. In order to define decompositions for directed graphs, similar games have been proposed in directed graphs. In this paper, we consider such a game...

The surveillance game [Fomin et al., 2012] models the prob- lem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The rst player, called the observer, can mark a xed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can slide...

In this paper, we study the (geodesic) hull number of graphs. For any two vertices $u,v\in V$ of a connected undirected graph $G=(V,E)$, the closed interval $I[u,v]$ of $u$ and $v$ is the set of vertices that belong to some shortest $(u,v)$-path. For any $S \subseteq V$, let $I[S]= \bigcup_{u,v\in S} I[u,v]$. A subset $S\subseteq V$ is...

In this paper, we study the (geodesic) hull number of graphs. For any two vertices $u,v\in V$ of a connected undirected graph $G=(V,E)$, the closed interval $I[u,v]$ of $u$ and $v$ is the set of vertices that belong to some shortest $(u,v)$-path. For any $S \subseteq V$, let $I[S]= \bigcup_{u,v\in S} I[u,v]$. A subset $S\subseteq V$ is...

International audience

The surveillance game [Fomin et al., 2012] models the prob- lem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The rst player, called the observer, can mark a xed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can slide...

In this paper, we study the geodetic convexity of graphs focusing on the problem of the complexity to compute inclusion-minimum hull set of a graph in several graph classes. For any two vertices $u,v\in V$ of a connected graph $G=(V,E)$, the {\em closed interval} $I[u,v]$ of $u$ and $v$ is the the set of vertices that belong to some shortest...

The surveillance game [Fomin et al., 2012] models the problem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The first player, called the observer, can mark a fixed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can...

In this paper, we study the geodetic convexity of graphs focusing on the problem of the complexity to compute a minimum hull set of a graph in several graph classes. For any two vertices $u,v\in V$ of a connected graph $G=(V,E)$, the closed interval $I[u,v]$ of $u$ and $v$ is the the set of vertices that belong to some shortest $(u,v)$-path....