Generation of Minimal Vertex Covers for Row/Column Allocation in Self-Repairable Arrays

Authors:
Michael D. Smith;Pinaki Mazumder
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1996

Citing 1
Cited 6

A Clustered Failure Model for the Memory Array Reconfiguration Problem

IEEE Transactions on Computers

Fault-Tolerant Processor Arrays Based on the 1$\frac{1}{2}$-Track Switches with Flexible Spare Distributions

IEEE Transactions on Computers
Some Prospects for Efficient Fixed Parameter Algorithms

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
An approximation algorithm based on chain implication for constrained minimum vertex covers in bipartite graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An exact algorithm based on chain implication for the Min-CVCB problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper lays foundations for an approach to on-chip row/column allocation that exploits certain properties offered by laterally connected networks of simple threshold devices. As a sample application, it is demonstrated how electronic implementations of these networks can be used as the basis for effective memory array repair systems that require little hardware overhead