论文标题
最小$α$ dominating set的自动化算法
Self-stabilizing Algorithm for Minimal $α$-Dominating Set
论文作者
论文摘要
本文提出了一种最小$α$ domination集的自动化算法。 $α$ domination参数以前在自动稳定范式中尚未使用。使用$ n $节点和$ m $边缘的任意图，拟议的算法将分布式守护程序下的$ O（nm）$移动收敛。仿真测试和数学证明显示算法的效率。
A self-stabilizing algorithm for the minimal $α$-dominating set is proposed in this paper. The $α$-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.
