Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Modeling the Effect of Redundancy on Yield and Performance of VLSI Systems
IEEE Transactions on Computers
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Modeling Defect Spatial Distribution
IEEE Transactions on Computers
On the repair of redundant RAMs
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Increased Throughput for the Testing and Repair of RAMs with Redundancy
IEEE Transactions on Computers
A New Class Of Efficient Algorithms For Reconfiguration Of Memory Arrays
IEEE Transactions on Computers
A new bound on the feedback vertex sets in cubic graphs
Discrete Mathematics
An IDA algorithm for optimal spare allocation
Proceedings of the 1999 ACM symposium on Applied computing
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
A Built-In Self-Repair Analyzer (CRESTA) for embedded DRAMs
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
The State-of-Art and Future Trends in Testing Embedded Memories
MTDT '04 Proceedings of the Records of the 2004 International Workshop on Memory Technology, Design and Testing
Efficient Exact Spare Allocation via Boolean Satisfiability
DFT '05 Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
Efficient Spare Allocation for Reconfigurable Arrays
IEEE Design & Test
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
TAMC '09 Proceedings of the 6th Annual 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
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
| Hi-index | 0.00 |
Constraint bipartite vertex cover is 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. We also discuss possible generalizations and enhancements.