【摘要】 二分图的覆盖求解是一经典图论问题，该问题的求解可应用于并行阵列的重组和超大规模集成电路的修复．本文提出二分图的无关分解概念，并给出两种具体算法及其结果．更多还原

【Abstract】 Covering solution of bipartite graph is a classic problem. It can be used to reconfigure a faulty parallel array and to repair a defect VLSI circuit. We invent the concept of independent factorization of bipartite graph and use it to propose two approaches for repair.更多还原