Construction d'un ensemble d-dominant sur un graphe en utilisant un critère donné

Alexandre Delye de Clauzade de Mazieux; Michel Marot; Monique Becker

doi:10.1016/j.crme.2006.09.001

Construction d'un ensemble d-dominant sur un graphe en utilisant un critère donné

Translated title of the contribution: Construction of a d-dominating set on a graph by using a given criterion

Alexandre Delye de Clauzade de Mazieux
, Michel Marot
, Monique Becker

CNRS UMR 5157 SAMOVAR

Research output: Contribution to journal › Article › peer-review

Abstract

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).

Translated title of the contribution	Construction of a d-dominating set on a graph by using a given criterion
Original language	French
Pages (from-to)	669-673
Number of pages	5
Journal	Comptes Rendus - Mecanique
Volume	334
Issue number	11
DOIs	https://doi.org/10.1016/j.crme.2006.09.001
Publication status	Published - 1 Nov 2006

Access to Document

10.1016/j.crme.2006.09.001

Cite this

@article{94758c5b2a024b009621f79c7293937b,

title = "Construction d'un ensemble d-dominant sur un graphe en utilisant un crit{\`e}re donn{\'e}",

abstract = "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).",

keywords = "Clusterhead selection, Graph theory, Heuristic, Operational researches, Trees, d-dominating set",

author = "\{Delye de Clauzade de Mazieux\}, Alexandre and Michel Marot and Monique Becker",

year = "2006",

month = nov,

day = "1",

doi = "10.1016/j.crme.2006.09.001",

language = "Fran{\c c}ais",

volume = "334",

pages = "669--673",

journal = "Comptes Rendus - Mecanique",

issn = "1631-0721",

number = "11",

}

TY - JOUR

T1 - Construction d'un ensemble d-dominant sur un graphe en utilisant un critère donné

AU - Delye de Clauzade de Mazieux, Alexandre

AU - Marot, Michel

AU - Becker, Monique

PY - 2006/11/1

Y1 - 2006/11/1

N2 - 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).

AB - 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).

KW - Clusterhead selection

KW - Graph theory

KW - Heuristic

KW - Operational researches

KW - Trees

KW - d-dominating set

U2 - 10.1016/j.crme.2006.09.001

DO - 10.1016/j.crme.2006.09.001

M3 - Article

AN - SCOPUS:33750696981

SN - 1631-0721

VL - 334

SP - 669

EP - 673

JO - Comptes Rendus - Mecanique

JF - Comptes Rendus - Mecanique

IS - 11

ER -

Construction d'un ensemble d-dominant sur un graphe en utilisant un critère donné

Abstract

Access to Document

Fingerprint

Cite this