Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 2014

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

Abstract

We 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.
Not file

Dates and versions

hal-01270709 , version 1 (08-02-2016)

Identifiers

  • HAL Id : hal-01270709 , version 1

Cite

Yacine Belhoul, Saïd Yahiaoui, Hamamache Kheddouci. Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs. Information Processing Letters, 2014, 7, 114, pp.339-343. ⟨hal-01270709⟩
61 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More