1 citations · 1 across the 3 of their papers we have counts for
5 papers
Output-linear time enumeration of potential maximal cliques
Pierre Bergé, Vincent Limouzy, Nicolas Schivre
First defined by Bouchitté and Todinca, Potential Maximal Cliques (PMC) are a well studied notion in graph theory due to its numerous applications. The PMCs of an undirected graph…
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…
Quasilinear-time eccentricities computation, and more, on median graphs
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph cla…
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_* \s…
Approximation algorithms for Job Scheduling with reconfigurable resources
Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon +1
We consider here the MultiBot problem for the scheduling and the resource parametrization of jobs related to the production or the transportation of different products inside a giv…