Disjoint Covers in Replicated Heterogeneous Arrays

DOI10.1137/0404026MaRDI QIDQ5202961zbMATH OpenOpenAlexFDO

Authors

Publication date 1991

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://scholarship.claremont.edu/hmc_fac_pub/900

zbMATH Keywords

fault cover problemheterogeneous arrayReconfigurable chipsredundant elements

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Problems and algorithms for covering arrays via set covers
• Mixed covering arrays on graphs
• scientific article; zbMATH DE number 5556019
• scientific article; zbMATH DE number 5177325
• Covering arrays on graphs
• A survey on the problems and algorithms for covering arrays via set covers
• Maximally disjoint solutions of the set covering problem
• Structures and lower bounds for binary covering arrays

Cited in

(3)

• scientific article; zbMATH DE number 53430 (Why is no real title available?)
• Harvest rate of reconfigurable pipelines
• Generation of minimal vertex covers for row/column allocation in self-repairable arrays

This page was built for publication: Disjoint Covers in Replicated Heterogeneous Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202961)