二分图约束的顶点覆盖问题的快速算法-昆明理工大学学报.pdf

28 ( ) Vol. 28 No 2003 10 Journal of Kunming University of Science and Technology (Science and Technology) Oct . 2003 何 峰, 车文刚 ( , 6 00 1) : 对超大规模集成电路芯片( VLSI) 的缺陷修复可归结为受二分图约束的顶点覆盖问 , 该 问 属于NP 完全问 . 目前仍不能在多项式时间内对该问 求解. 本文应用参数计算理论, 将 问 化简为与输入问 规模无关的问 来求解. 并利用二分图的特性, 提出了一种简单高效的 算法, 大大提高了修复速度. : 可修复阵列; 二分图; 顶点覆盖; 匹配; 参数计算 :TP393 : A : 1007- 8 X( 2003) 0 - 008 - 0 An Efficient Algorithm for Constraint Bipartite Vertex Cover HE Feng, CHE Wen-ga ng ( Faculty of Information Engineering and Automation, Kunming University of Science and Technology , Kunming 6 00 1, China) Abstract: The fault coverage problem for reconfigurable arrays has received as constraint bipartite vertex cover problem, which is proved as a NP- complete. It cant be resolved in polynomial running time. The theory of pa- rameterised computation is used to reduce the kernel of problem which is independent of the original problem . Furthermore, the algorithms running time is bounded by the study for the characteristics of the bipartite graph. Key words: reconfigurable arrays; bipartite graph; vertex cover; graph matching; parameterised computation 0 , . . , [ , 6] ( SR) ( SC) , [6] [ ] .Kuo Fuchs : M N , SR SC m n . ,Kuo Fuchs : , , . . , . - , ( SR, SC 20) . [ 1] , . . , 20 90 , . Buss[ 9] , k 2K + 2 [ 10] k 2 O ( kn + 2 k ) , Downey Fellows O ( kn + 1322 718 k ) . Bala- subramanian[ 2] 2 . [ 2] [ 3] . , Chen Kan