计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (21): 9-13.DOI: 10.3778/j.issn.1002-8331.2010.21.003

• 博士论坛 • 上一篇    下一篇

有向图连通支配集求解算法

高文宇   

  1. 广东商学院 信息学院,广州 510320
  • 收稿日期:2010-04-26 修回日期:2010-06-10 出版日期:2010-07-21 发布日期:2010-07-21
  • 通讯作者: 高文宇

Algorithm of digraph connected dominating set

GAO Wen-yu   

  1. School of Information Science,Guangdong University of Business Studies,Guangzhou 510320,China
  • Received:2010-04-26 Revised:2010-06-10 Online:2010-07-21 Published:2010-07-21
  • Contact: GAO Wen-yu

摘要: 定义了有向图指定源点连通支配集问题。借助参数算法中的技术设计了针对该问题的规约规则,通过规约规则的实施来降低原问题的规模;随后又设计了近似算法在规约后的有向图中求出一个较小的连通支配集;最后结合规约规则带来的一些良好特性设计了优化规则,通过优化变换的实施进一步缩减由近似算法求得的连通支配集。不同模型随机图上的模拟实验表明这些规则和算法是有效的。

关键词: 连通支配集, 有向图, 参数算法, 规约, 近似算法

Abstract: The problem of connected dominating set in digraph is defined.A reduction rule for this problem is designed.Reduction rules can reduce the size of original digraph;then an approximation algorithm is designed to find a connected dominating set in the reduced digraph;finally,optimization rule is used to cut down the size of connected dominating set.Simulations in different random digraphs show that these rules and algorithms are effective.

Key words: connected dominating set, digraph, parameterized algorithm, reduction, approximation

中图分类号: