Mixed covering arrays on 3-uniform hypergraphs

DOI10.1016/j.dam.2017.08.023zbMath1372.05145arXiv1508.07393OpenAlexW2237693752MaRDI QIDQ2410218

Soumen Maity, Yasmeen Akhtar

Publication date: 17 October 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.07393

zbMATH Keywords

hypergraphsoftware testingcovering arrayhost graphmixed covering array

Mathematics Subject Classification ID

Hypergraphs (05C65) Signed and weighted graphs (05C22)

Related Items

Mixed covering arrays on graphs of small treewidth, A hyperedge coloring and application in combinatorial testing, A construction for strength-3 covering arrays from linear feedback shift register sequences, Cost-efficient mixed-level covering designs for testing experiments, Arrays for combinatorial interaction testing: a review on constructive approaches

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved monochromatic loose cycle partitions in hypergraphs
• Orthogonal arrays. Theory and applications
• Covering arrays of strength three
• Problems and algorithms for covering arrays
• Covering arrays on graphs
• On the Desirability of Acyclic Database Schemes
• On the state of strength-three covering arrays
• Vector sets for exhaustive testing of logic circuits
• Covering arrays with mixed alphabet sizes
• Mixed covering arrays on graphs
• Products of mixed covering arrays of strength two