Variable strength covering arrays-Reference-Cited by-同舟云学术

Variable strength covering arrays

Published:2018-03-30 Issue:9 Volume:26 Page:417-438
ISSN:1063-8539
Container-title:Journal of Combinatorial Designs
language:en
Short-container-title:J. Combin. Designs

Author:

Raaphorst Sebastian¹,Moura Lucia²,Stevens Brett³

Affiliation:

1. Gemini Observatory; AURA; Casilla 603 La Serena Chile

2. School of Electrical Engineering and Computer Science (EECS); University of Ottawa; 800 King Edward Street, P.O. Box 450, Station A Ottawa ON K1N 6N5 Canada

3. School of Mathematics and Statistics; Carleton University; 1125 Colonel By Drive Ottawa ON K1S 5B6 Canada

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

Wiley

Subject

Discrete Mathematics and Combinatorics

Reference21 articles.

1. Solution of the four color map problem;Appel;Sci. Am.,1977

2. A density-based greedy algorithm for higher strength covering arrays;Bryce;Softw. Test. Verification, and Reliab.,2009

3. Orthogonal arrays of index unity;Bush;Ann. Math. Stat.,1952

4. The test suite generation problem: Optimal instances and their implications;Cheng;Discrete Appl. Math.,2007

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Covering Array on the Cartesian Product of Hypergraphs;Graphs and Combinatorics;2024-07-10

2. A Survey of Cover-Free Families: Constructions, Applications, and Generalizations;Fields Institute Communications;2023-11-16

3. An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing;IEEE Transactions on Software Engineering;2023-10-01

4. Ordered covering arrays and upper bounds on covering codes;Journal of Combinatorial Designs;2023-03-30

5. A hyperedge coloring and application in combinatorial testing;AKCE International Journal of Graphs and Combinatorics;2022-05-04