求解区间图上的罗马控制数的动态规划算法

Dynamic programming algorithm to solve Roman domination number for interval graph

针对区间图的最小罗马控制函数和罗马控制数求解的困难性,提出了一种动态规划算法。从区间图的顶点排序开始,结合区间图的某些性质,采用逐步搜索的方法,不断扩大搜索的顶点集合范围,最终求出最优的罗马控制集和罗马控制数。为保证算法的正确性和科学性,对算法进行了严格的数学推理和证明。最后还给出了一个典型的区间图求解过程的演示示例,增强了算法的可读性和可操作性。结果表明该算法不仅运算速度快,而且简单易行。

This paper proposed a dynamic programming algorithm to find a minimum Roman dominating function and Roman domination number for an interval graph. It designed a step by step search algorithm to solve this problem. Starting with a vertex ordering of an interval graph,combining with some properties of interval graphs,it successfully found the optimum Roman dominating function and Roman domination number. It presented a mathematical proof to ensure the correctness of the algorithm. Finally it took an example to illustrate the procedure of the described algorithm. The results show that the algorithm is fast and effective.