A hyperedge coloring and application in combinatorial testing
From MaRDI portal
Publication:5097781
DOI10.1080/09728600.2022.2081523zbMath1496.05045OpenAlexW4281789728MaRDI QIDQ5097781
Publication date: 1 September 2022
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2022.2081523
Cites Work
- Cost-efficient mixed-level covering designs for testing experiments
- Covering arrays on product graphs
- Mixed covering arrays on 3-uniform hypergraphs
- Perfect matchings in balanced hypergraphs
- Vector sets for exhaustive testing of logic circuits
- Variable strength covering arrays
- Mixed covering arrays on graphs
- Unnamed Item
This page was built for publication: A hyperedge coloring and application in combinatorial testing