Construction d'un ensemble d-dominant sur un graphe en utilisant un critère donnéConstruction of a d-dominating set on a graph by using a given criterion

d-dominating sets in graphs are very important in system and network engineering. Their constructions is thus an important research topic. An heuristic which forms such sets by using a given criterion is proposed. We simplify the heuristic presented elsewhere. We extend it and prove the correctness of the extended heuristic. This heuristic has the advantage of being distributed and scalable. To cite this article: A. Delye de Clauzade de Mazieux et al., C. R. Mecanique 334 (2006).