Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

Simple item page
dc.citation.epage370fr_FR
dc.citation.issue10-11fr_FR
dc.citation.spage365fr_FR
dc.citation.volume113fr_FR
dc.contributor.authorBelhoul, Yacine
dc.contributor.authorYahiaoui, Saïd
dc.date.accessioned2013-11-24T16:03:27Z
dc.date.available2013-11-24T16:03:27Z
dc.date.issued2013-05
dc.description.abstractWe propose a self-stabilizing distributed algorithm for the minimal global powerful alliance set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some generalizations of the problem. Using an unfair distributed scheduler, the proposed algorithms converge in O (mn) moves starting from an arbitrary statefr_FR
dc.identifier.issn0020-0190
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/325
dc.publisherELSEVIER SCIENCEfr_FR
dc.relation.ispartofINFORMATION PROCESSING LETTERSfr_FR
dc.rights.holderElsevierfr_FR
dc.structureCalcul Pervasif et Mobilefr_FR
dc.subjectSelf-stabilizing algorithmsfr_FR
dc.subjectGraph algorithmsfr_FR
dc.subjectGlobal powerful alliancefr_FR
dc.subjectDistributed algorithmsfr_FR
dc.titleSelf-stabilizing algorithms for minimal global powerful alliance sets in graphsfr_FR
dc.typeArticle

Files

Collections

International Journal Papers