Hypergraph coloring and reconfigured RAM testing

DOI10.1109/12.286305MaRDI QIDQ4420050zbMATH OpenOpenAlexFDO

Authors Manoj Franklin, K. K. Saluja

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.286305

zbMATH Keywords

coupling faultspattern sensitive faults

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1754615
• Testing hypergraph colorability
• A hyperedge coloring and application in combinatorial testing
• scientific article; zbMATH DE number 2086691
• Hypergraph colouring
• Vertex coloring of a graph for memory constrained scenarios
• Testing graphs for colorability properties
• Testing graphs for colorability properties*
• A Random Recolouring Method for Graphs and Hypergraphs
• scientific article; zbMATH DE number 1047743

Cited in

(1)

• Testing Memories for Single-Cell Pattern-Sensitive Faults

This page was built for publication: Hypergraph coloring and reconfigured RAM testing

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