2 citations · 2 across the 2 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2024
On Iiro Honkala's contributions to identifying codes
Olivier Hudry, Ville Junnila, Antoine Lobstein
A set of vertices in a graph is an identifying code if it is dominating and any two vertices of are dominated by distinct sets of codewords. This paper presents a…
cs.DM2023
Nonatomic Non-Cooperative Neighbourhood Balancing Games
David Auger, Johanne Cohen, Antoine Lobstein
We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resource…
cs.DM2010★ 2 cited
Watching Systems in graphs: an extension of Identifying Codes
David Auger, Irène Charon, Olivier Hudry +1
We introduce the notion of watching systems in graphs, which is a generalization of that of identifying codes. We give some basic properties of watching systems, an upper bound on…