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

被引：7
|
作者：
Belhoul, Yacine [1 ,2 ]
Yahiaoui, Said [1 ,2 ]
Kheddouci, Hamamache [3 ]
机构：
[1] Univ A Mira, Dept Informat, Bejaia 06000, Algeria
[2] CERIST, Algiers 16030, Algeria
[3] Univ Lyon 1, CNRS, LIRIS, UMR5205, F-69622 Villeurbanne, France
来源：
INFORMATION PROCESSING LETTERS | 2014年 / 114卷 / 07期
关键词：
Distributed self-stabilizing algorithms; Graph algorithms; Minimal total dominating set; Minimal total k-domination; k-Tuple total dominating set; SYSTEMS;
D O I：
10.1016/j.ipl.2014.02.002
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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(logn) storage per node. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：339 / 343
页数：5
相关论文
共 50 条
  • [1] Self-Stabilizing Distributed Formation of Minimal k-Dominating Sets in Mobile Ad Hoc Networks
    Yen, Li-Hsing
    Chen, Zong-Long
    2014 TENTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING (IIH-MSP 2014), 2014, : 723 - 728
  • [2] Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
    Hedetniemi, SM
    Hedetniemi, ST
    Jacobs, DP
    Srimani, PK
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2003, 46 (5-6) : 805 - 811
  • [3] A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
    Datta, Ajoy K.
    Devismes, Stephane
    Larmore, Lawrence L.
    THEORETICAL COMPUTER SCIENCE, 2019, 753 : 35 - 63
  • [4] A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
    Hedetniemi, Stephen T.
    Jacobs, David P.
    Kennedy, K. E.
    THEORETICAL COMPUTER SCIENCE, 2015, 593 : 132 - 138
  • [5] New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets
    Ding, Yihua
    Wang, James Z.
    Srimani, Pradip K.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (02) : 229 - 240
  • [6] A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
    Hedetniemi, Stephen T.
    Jacobs, David P.
    Kennedy, K.E.
    Theoretical Computer Science, 2015, 593 : 132 - 138
  • [7] Self-stabilizing algorithms for efficient sets of graphs and trees
    Turau, Volker
    INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 771 - 776
  • [8] Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs
    Neggazi, Brahim
    Guellati, Nabil
    Haddad, Mohammed
    Kheddouci, Hamamache
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 751 - 768
  • [9] Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
    Yahiaoui, Said
    Belhoul, Yacine
    Haddad, Mohammed
    Kheddouci, Hamamache
    INFORMATION PROCESSING LETTERS, 2013, 113 (10-11) : 365 - 370
  • [10] Self-stabilizing algorithm for two disjoint minimal dominating sets
    Srimani, Pradip K.
    Wang, James Z.
    INFORMATION PROCESSING LETTERS, 2019, 147 : 38 - 43
12345