Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs

Simple item page
dc.citation.epage343fr_FR
dc.citation.issue7fr_FR
dc.citation.spage339fr_FR
dc.citation.volume114fr_FR
dc.contributor.authorBelhoul, Yacine
dc.contributor.authorYahiaoui, Saïd
dc.contributor.authorKheddouci, Hamamache
dc.date.accessioned2014-04-29T09:22:36Z
dc.date.available2014-04-29T09:22:36Z
dc.date.issued2014-07
dc.description.abstractWe propose the first polynomial self-stabilizing distributed algorithm for the minimal total dominating set problem in an arbitrary graph. Then, we generalize the proposed algorithm for the minimal total k -dominating set problem. Under an unfair distributed scheduler, the proposed algorithms converge in O(mn) moves starting from any arbitrary state, and require O(log n) storage per node.fr_FR
dc.identifier.issn0020-0190
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/655
dc.publisherElsevierfr_FR
dc.relation.ispartofInformation Processing Lettersfr_FR
dc.rights.holderElsevierfr_FR
dc.structureCalcul Pervasif et Mobilefr_FR
dc.subjectDistributed self-stabilizing algorithmsfr_FR
dc.subjectGraph algorithmsfr_FR
dc.subjectMinimal total dominating setfr_FR
dc.subjectMinimal total k-dominationfr_FR
dc.subjectk-Tuple total dominating setfr_FR
dc.titleEfficient self-stabilizing algorithms for minimal total k-dominating sets in graphsfr_FR
dc.typeArticle
Files
Collections
International Journal Papers