François Delbot

collaborators

3 papers

math.CO2023

On the complexity of Dominating Set for graphs with fixed diameter

Valentin Bouquet, François Delbot, Christophe Picouleau +1

A set $S \subseteq V$ of a graph $G = (V, E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$ . Dominating Set is the problem of deciding, given a graph $G$ a…

math.CO2020

On Minimum Dominating Sets in cubic and (claw,H)-free graphs

Valentin Bouquet, François Delbot, Christophe Picouleau +1

Given a graph $G = (V, E)$ , $S \subseteq V$ is a dominating set if every $v \in V ∖ S$ is adjacent to an element of $S$ . The Minimum Dominating Set problem asks for a dominating…

cs.DC2014

Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems

François Delbot, Christian Laforest, Stephane Rovedakis

In many wireless networks, there is no fixed physical backbone nor centralized network management. The nodes of such a network have to self-organize in order to maintain a virtual…