| 基于堆的最小连通支配集高效近似算法 |
| |
| 引用本文： | 赵学锋,杨海斌,张贵仓.基于堆的最小连通支配集高效近似算法[J].计算机工程,2011,37(2):54-56. |
| |
| 作者姓名： | 赵学锋 杨海斌 张贵仓 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院,兰州,730070 |
| |
| 基金项目： | 甘肃省科技攻关计划基金资助项目(2GS035-A052-011) |
| |
| 摘 要： | 提出一种解决连通网络图上连通支配集(CDS)问题的贪心近似算法。利用堆结构逐步选出支配节点，将支配节点加入由之前已确定节点组成的树中，完成网络图中支配树的构造。通过计算堆操作次数，分析算法在平均情况下的时间复杂度。在随机网络模型上的模拟实验结果表明，与已有算法相比，该算法可以得到点数更少的连通支配集。
|
| 关 键 词： | 最小连通支配集 堆 CDT算法 |
Efficient Approximation Algorithm for Minimum Connected Dominating Set Based on Heap |
| |
| ZHAO Xue-feng,YANG Hai-bin,ZHANG Gui-cang.Efficient Approximation Algorithm for Minimum Connected Dominating Set Based on Heap[J].Computer Engineering,2011,37(2):54-56. |
| |
| Authors: | ZHAO Xue-feng YANG Hai-bin ZHANG Gui-cang |
| |
| Affiliation: | ZHAO Xue-feng,YANG Hai-bin,ZHANG Gui-cang(College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China) |
| |
| Abstract: | This paper proposes a greedy approximation algorithm to solve Connected Dominating Set(CDS) problem in connected graphs.It uses ordinary heap to repeatedly select a dominating node and adds it to the tree formed by the determined nodes,so that a dominating tree for the graph is constructed.Its time complexity is analyzed in the average case by calculating the number of the heap operations.Experimental results on random network models show that compared with the existing algorithms,CDS constructed by the pro... |
| |
| Keywords: | Minimum Connected Dominating Set(MCDS) heap CDT algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
