1 citations · 1 across the 3 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
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…
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…