Mixed covering arrays on graphs and tabu search algorithms

Latifa Zekaoui
Covering arrays are combinatorial objects that have been successfully applied in the design of test suits for testing software, networks and circuits. Mixed covering arrays on graphs are new generalizations of both mixed covering arrays and covering arrays on graphs. In this thesis, we give new theoretical results and constructions for mixed covering arrays on graphs. First, we extend to the mixed case the work done by Meagher and Stevens [31], which uses graph homomorphisms...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.