论文标题
计算完整的Mary树中的功率支配集
Counting Power Domination Sets in Complete m-ary Trees
论文作者
论文摘要
通过按照统一的随机放置K监测器的概率的问题，在本文中，我们给出了一个递归公式，以计算标记为完整的M-Ary树中大小K的功率支配次数。作为推论，我们表明可以使用线性指数时间以指数计算所需的概率。
Motivated by the question of computing the probability of successful power domination by placing k monitors uniformly at random, in this paper we give a recursive formula to count the number of power domination sets of size k in a labeled complete m-ary tree. As a corollary we show that the desired probability can be computed in exponential with linear exponent time.
