Weighted Vertex Cover Using Disjoint Set Data Structures for the Memory Reconfiguration Problem

We propose a minimum weighted vertex cover method relying on modified disjoint data set structures and Kruskal algorithm for purposes of the memory reconfiguration problem. With column-muxing, the problem of redundancy allocation and planning with spare columns and spare rows must account for the column versus row redundancy block costs. The proposed algorithm is comprehensive and computationally efficient. It enables reducing the budget of repair by upto 70% compared to an all row repair solution. It also highlights the difference in redundancy planning requirements based on the underlying column muxing strategy for fixed array size.