Mixed covering arrays on graphs of small treewidth

DOI10.1142/S1793830921500853OpenAlexW3154438022MaRDI QIDQ5063252

Soumen Maity, Charles J. Colbourn

Publication date: 17 March 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500853

zbMATH Keywords

matchingedge covercovering arrays

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of packing and covering (05B40)

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. III. Planar tree-width
• Orthogonal arrays. Theory and applications
• Covering arrays of strength three
• Treewidth. Computations and approximations
• Problems and algorithms for covering arrays
• Covering arrays on product graphs
• Mixed covering arrays on 3-uniform hypergraphs
• Covering arrays on graphs
• On the state of strength-three covering arrays
• Vector sets for exhaustive testing of logic circuits
• Covering arrays with mixed alphabet sizes
• Variable strength covering arrays
• Mixed covering arrays on graphs
• Products of mixed covering arrays of strength two

This page was built for publication: Mixed covering arrays on graphs of small treewidth