Covering Arrays on Product Graphs
Yasmeen Akhtar, Soumen Maity

TL;DR
This paper investigates the construction of optimal covering arrays on product graphs, providing bounds, special cases where bounds are tight, and an approximation algorithm for complex graphs.
Contribution
It introduces bounds and constructions for covering arrays on product graphs, and presents a polynomial-time approximation algorithm for large, composite graphs.
Findings
Bounds on covering array sizes for graph products
Families of graphs where bounds are tight
A polynomial-time approximation algorithm with logarithmic ratio
Abstract
Two vectors in are if for all pairs , there exists such that . A covering array on a graph , denoted by , is a array on with the property that any two rows which correspond to adjacent vertices in are qualitatively independent. The number of columns in such array is called its . Given a graph , a covering array on with minimum size is called . Our primary concern in this paper is with constructions that make optimal covering arrays on large graphs those are obtained from product of smaller graphs. We consider four most extensively studied graph products in literature and give upper and lower bounds on the the size of covering arrays on graph products. We find families of graphs…
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.
