Cost-Efficient Mixed-Level Covering Designs for Testing Experiments-Reference-Cited by-同舟云学术

Cost-Efficient Mixed-Level Covering Designs for Testing Experiments

Published:2019-11-25 Issue:1 Volume:14 Page:
ISSN:1559-8608
Container-title:Journal of Statistical Theory and Practice
language:en
Short-container-title:J Stat Theory Pract

Author:

Akhtar Yasmeen,Phoa Frederick Kin Hing

Funder

Academia Sinica

Ministry of Science and Technology, Taiwan

Publisher

Springer Science and Business Media LLC

Subject

Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/s42519-019-0062-7.pdf

Reference26 articles.

1. Akhtar Y, Maity S (2017) Mixed covering arrays on 3-uniform hypergraphs. Discrete Appl Math 232:8–22

2. Ang N (2015) Generating Mixed-Level Covering Arrays with λ = 2 and Test Prioritization, M.Sc. thesis, Arizona State University

3. Baranyai Z (1975) On the factorization of the complete uniform hypergraph. In: Infinite and Finite Sets, Coll. Math. J. Bolyai, 10, Bolyai J. Mat. Tirsulat, Budapest, North Holland, Amsterdam, pp 91–108

4. Baranyai Z (1978) La coloration des arêtes des hypergraphes complets II. In: Problèmes Combinatoires et Théorie des Graphes, Coll. C.N.R.S. Orsay 1976, (Bermond, Fournier, Las Vergnas, Sotteau), C.N.R.S., Paris, pp 19–22

5. Baranyai Z (1979) The edge-coloring of complete hypergraphs I. J Comb Theory Ser B 26:276–294

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

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

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