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 条
  • [41] Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph
    Ding, Yihua
    Wang, James Z.
    Srimani, Pradip K.
    PARALLEL PROCESSING LETTERS, 2015, 25 (04)
  • [42] Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem
    Kobayashi, Hisaki
    Kakugawa, Hirotsugu
    Masuzawa, Toshimitsu
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2017, 2018, 10616 : 378 - 383
  • [43] A Self-Stabilizing Minimal k-Grouping Algorithm
    Datta, Ajoy K.
    Larmore, Laurence L.
    Masuzawa, Toshimitsu
    Sudo, Yuichi
    18TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING (ICDCN 2017), 2017,
  • [44] Self-stabilizing global optimization algorithms for large network graphs
    Goddard, W
    Hedetniemi, ST
    Jacobs, DP
    Srimani, PK
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2005, 1 (3-4): : 329 - 344
  • [45] Distance-k information in self-stabilizing algorithms
    Goddard, Wayne
    Hedetniemi, Stephen T.
    Jacobs, David P.
    Trevisan, Vilmar
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2006, 4056 : 349 - 356
  • [46] Anonymous Self-Stabilizing Distributed Algorithms for Connected Dominating Set in a Network Graph
    Goddard, Wayne
    Srimani, Pradip K.
    IMCIC 2010: INTERNATIONAL MULTI-CONFERENCE ON COMPLEXITY, INFORMATICS AND CYBERNETICS, VOL I (POST-CONFERENCE EDITION), 2010, : 356 - 361
  • [47] Distributed construction of small k-dominating sets and applications
    Kutten, S
    Peleg, D
    JOURNAL OF ALGORITHMS, 1998, 28 (01) : 40 - 66
  • [48] An improvement on the maximum number of k-dominating independent sets
    Gerbner, Daniel
    Keszegh, Balazs
    Methuku, Abhishek
    Patkos, Balazs
    Vizer, Mate
    JOURNAL OF GRAPH THEORY, 2019, 91 (01) : 88 - 97
  • [49] Distance-k knowledge in self-stabilizing algorithms
    Goddard, Wayne
    Hedetniemi, Stephen T.
    Jacobs, David P.
    Trevisan, Vilmar
    THEORETICAL COMPUTER SCIENCE, 2008, 399 (1-2) : 118 - 127
  • [50] Self-Stabilizing Metric Graphs
    Gmyr, Robert
    Lefevre, Jonas
    Scheideler, Christian
    THEORY OF COMPUTING SYSTEMS, 2019, 63 (02) : 177 - 199
12345