Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs-Reference-Cited by-同舟云学术

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

Published:2014-07 Issue:7 Volume:114 Page:339-343
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Belhoul Yacine,Yahiaoui Saïd,Kheddouci Hamamache

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference29 articles.

1. Self-stabilizing global optimization algorithms for large network graphs;Goddard;Int. J. Distrib. Sens. Netw.,2005

2. Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks;Alzoubi;Int. J. Found. Comput. Sci.,2003

3. On calculating connected dominating set for efficient routing in ad hoc wireless networks;Wu,1999

4. B. Das, V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: Proceedings of IEEE International Conference on Communications, ICC'97, vol. 1, pp. 376–380.

5. Total domination in graphs;Cockayne;Networks,1980

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self‐stabilizing distributed algorithm for the bounded lattice domination problems under the distance‐2 model;Concurrency and Computation: Practice and Experience;2023-09-11

2. An Approximation Algorithm for a Variant of Dominating Set Problem;Axioms;2023-05-23

3. Self-stabilizing algorithm for minimal (α,β)-dominating set;International Journal of Computer Mathematics: Computer Systems Theory;2022-04-03

4. Towards efficient local search for the minimum total dominating set problem;Applied Intelligence;2021-04-13

5. An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs;2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT);2020-12