Belhoul, YacineYahiaoui, SaïdKheddouci, Hamamache2014-04-292014-04-292014-070020-0190http://dl.cerist.dz/handle/CERIST/655We 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.Distributed self-stabilizing algorithmsGraph algorithmsMinimal total dominating setMinimal total k-dominationk-Tuple total dominating setArticleElsevier