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 条
  • [31] Game-Theoretic Approach to Self-Stabilizing Distributed Formation of Minimal Multi-Dominating Sets
    Yen, Li-Hsing
    Chen, Zong-Long
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (12) : 3201 - 3210
  • [32] Efficient total dominating sets in Cayley graphs
    MacGillivray, Gary
    Warren, J. Maria
    UTILITAS MATHEMATICA, 2014, 94 : 347 - 359
  • [33] Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets
    Kamei, Sayaka
    Kakugawa, Hirotsugu
    2018 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2018), 2018, : 278 - 284
  • [34] K-dominating sets of cardinal products of paths
    Klobucar, A
    Seifter, N
    ARS COMBINATORIA, 2000, 55 : 33 - 41
  • [35] Efficient self-stabilizing algorithms for tree networks
    Blair, JRS
    Manne, F
    23RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, : 20 - 26
  • [36] A distributed algorithm to find k-dominating sets
    Penso, LD
    Barbosa, VC
    DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 243 - 253
  • [37] Efficient Self-stabilizing Grundy Coloring Algorithms
    Mansouri, Ali
    Bouhlel, Mohamed Salim
    PROCEEDINGS OF 2016 FUTURE TECHNOLOGIES CONFERENCE (FTC), 2016, : 199 - 205
  • [38] Trees with extremal numbers of k-dominating sets
    Taletskii, D. S.
    DISCRETE MATHEMATICS, 2022, 345 (01)
  • [39] Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
    Czygrinow, Andrzej
    Hanckowiak, Michal
    Wawrzyniak, Wojciech
    Witkowski, Marcin
    THEORETICAL COMPUTER SCIENCE, 2020, 809 (809) : 327 - 338
  • [40] A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks
    Kamei, S
    Kakugawa, H
    PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 720 - 724
12345