Self-stabilizing Algorithm for Minimal $\alpha$-Dominating Set
arXiv (Cornell University)(2020)
摘要
A self-stabilizing algorithm for the minimal $\alpha$-dominating set is proposed in this paper. The $\alpha$-domination parameter has not used before in self-stabilization paradigm. Using an arbitrary graph with $n$ nodes and $m$ edges, the proposed algorithm converges in $O(nm)$ moves under distributed daemon. Simulation tests and mathematical proofs show the efficiency of the algorithm.
更多查看译文
关键词
minimal,algorithm,$\alpha$-dominating,self-stabilizing
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要