科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we propose a new self-stabilizing algorithm for minimal weakly connected dominating sets (called algorithm ). For an arbitrary connected graph with nodes, algorithm terminates in steps using a synchronous daemon. The space requirement at each node is bits. In the literature, the best reported stabilization time for a minimal weakly connected dominating set algorithm is under a distributed daemon, where is the number of edges and is the number of moves to construct a breadth-first tree.
- 出版日期2016-2
