Modeling the Effect of Redundancy on Yield and Performance of VLSI Systems
IEEE Transactions on Computers
Modeling Defect Spatial Distribution
IEEE Transactions on Computers
Increased Throughput for the Testing and Repair of RAMs with Redundancy
IEEE Transactions on Computers
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms
A Clustered Failure Model for the Memory Array Reconfiguration Problem
IEEE Transactions on Computers
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Efficient Spare Allocation for Reconfigurable Arrays
IEEE Design & Test
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
Parameterized Complexity
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
Constraint bipartite vertex cover: simpler exact algorithms and implementations
Journal of Combinatorial Optimization
A built-in repair analyzer with optimal repair rate for word-oriented memories
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
constraint bipartite vertex coveris a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.