ISSN 1000-1239 CN 11-1777/TP

• 论文 • 上一篇    下一篇


王建新1 许小双1,2 冯启龙1 李 敏1   

  1. 1(中南大学信息科学与工程学院 长沙 410083) 2(浙江中烟工业有限责任公司信息中心 杭州 310009) (
  • 出版日期: 2008-09-15

An Exact Algorithm Based on Chain Indication for Min-CVCB Problem

Wang Jianxin1, Xu Xiaoshuang1,2, Feng Qilong1, and Li Min1   

  1. 1(School of Information Science and Engineering, Central South University, Changsha 410083) 2(Information Center, China Tobacco Zhejiang Industrial Co. Ltd., Hangzhou 310009)
  • Online: 2008-09-15

摘要: 随着VLSI(超大规模集成电路)技术的发展,关于可重构阵列二分图的受约束最小点覆盖(Min-CVCB)问题受到了很多文献的关注.作为点覆盖问题的子问题,该问题已被证明是NP-完全问题.人们利用核心化和分支即使给出了时间复杂度为O((k\-u+k\-l)|G|+1.26\+\{k\-u+k\-l\})的目前最好算法,然而仍不能满足实际工程的需要.通过进一步深入分析二分图的结构,对含有权值大于或等于3的块的连通子图分析其可能连接情况后充分利用“链暗示”技术和分枝搜索技术来建立起新的搜索递推关系;对于分枝后的块提出了一种动态规划算法,其可在多项式时间内完成处理.整个参数算法的运行时间为O((k\-u+k\-l)|G|+1.1892\+\{k\-u+k\-l\}),极大地改进了目前的最好结果.

关键词: 二分图, 点覆盖, 精确算法, 参数计算, 动态规划

Abstract: With the technical development of VLSI (very large scale integrated circuit), the constrained minimum vertex cover in bipartite graphs (Min-CVCB) for re-configurable arrays has attracted considerable attention in the literature. The Min-CVCB problem is a classical sub-problem of vertex cover problem, and has been proved to be NP-complete. At present, the best exact algorithm for the problem is proposed by using kernelization and branching technology with running time bounded by O((k\-u+k\-l)|G|+1.26\+\{k\-u+k\-l\}), which is still unable to satisfy the requirement of the industry development. Based on the above result, an improved parameterized algorithm is presented for the Min-CVCB problem. For the Min-CVCB problem, a more detailed analysis is given for the structure of the bipartite graph and list all the possible joint of the blocks whose weight are at least 3 in a case-by-case exhaustive manner. Based on the above analysis, full use is made of the chain implication and bounded searching technology is used to construct new recurrence relations. For the remaining blocks generated by branching, dynamic programming technology is used to handle, which can be solved in polynomial time. The total time complexity of this algorithm is bounded by O((k\-u+k\-l)|G|+1.1892\+\{k\-u+k\-l\}), which greatly improves the current best result.

Key words: bipartite graph, vertex cover, exact algorithm, parameterized computation, dynamic programming