Mixed Covering Arrays on 3-Uniform Hypergraphs
Yasmeen Akhtar, Soumen Maity

TL;DR
This paper generalizes covering arrays to 3-uniform hypergraphs, introducing new constructions and operations to create optimal arrays for complex hypergraph structures, enhancing testing applications.
Contribution
It introduces five hypergraph operations to construct optimal mixed covering arrays on various 3-uniform hypergraphs, expanding the theoretical framework.
Findings
Constructed optimal arrays for $oldsymbol{eta}$-acyclic hypergraphs
Developed arrays for conformal 3-uniform hypertrees
Provided arrays for specific 3-uniform cycle hypergraphs
Abstract
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their parameters. In this paper, we perform a new generalization of covering arrays called covering arrays on 3-uniform hypergraphs. Let be positive integers with . Three vectors , , are {\it 3-qualitatively independent} if for any triplet , there exists an index such that . Let be a 3-uniform hypergraph with vertices with respective vertex weights . A mixed covering array on ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and Analog Circuit Testing · graph theory and CDMA systems · Interconnection Networks and Systems
