Now showing items 1-1 of 1

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

    Belhoul, Yacine; Yahiaoui, Saïd; Kheddouci, Hamamache
    In : Information Processing Letters, (Elsevier, 2014-07)
    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 ...

Tous les documents dans CERIST DIGITAL LIBRARY sont protégés par copyright, avec tous droits réservés. copyright © 2013-2015  CERIST
Powered by 
@mire NV