International Journal Papers

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/17

Browse

Subject: search.filters.subject.Graph algorithms

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
    (Elsevier, 2014-07) Belhoul, Yacine; Yahiaoui, Saïd; Kheddouci, Hamamache
    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.
  • Thumbnail Image
    Item
    Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
    (ELSEVIER SCIENCE, 2013-05) Belhoul, Yacine; Yahiaoui, Saïd
    We 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 state