2 papers
cs.DS2026
Nemesis, an Escape Game in Graphs
Pierre Bergé, Antoine Dailly, Yan Gerard
We define a new escape game in graphs that we call Nemesis. The game is played on a graph having a subset of vertices labeled as exits and the goal of one of the two players, calle…
cs.DS2025
The Canadian Traveller Problem on outerplanar graphs
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev +5
We study the -Canadian Traveller Problem, where a weighted graph with a source and a target are given. This problem also has a hidden input $E_* \…