Mixed covering arrays on graphs of small treewidth

DOI10.1142/S1793830921500853OpenAlexW3154438022MaRDI QIDQ5063252FDOQ5063252

Authors: 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

Recommendations

• Mixed covering arrays on graphs
• Mixed covering arrays on 3-uniform hypergraphs
• scientific article; zbMATH DE number 5556019
• Covering arrays with mixed alphabet sizes
• Item:QQ2409504

zbMATH Keywords

matchingedge covercovering arrays

Mathematics Subject Classification ID

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

Cites Work

• Orthogonal arrays. Theory and applications
• Title not available (Why is that?)
• Products of mixed covering arrays of strength two
• Problems and algorithms for covering arrays
• Treewidth. Computations and approximations
• Graph minors. III. Planar tree-width
• Covering arrays on graphs
• Mixed covering arrays on 3-uniform hypergraphs
• On the state of strength-three covering arrays
• Software and hardware testing using combinatorial covering suites
• Variable strength covering arrays
• Mixed covering arrays on graphs
• Covering arrays with mixed alphabet sizes
• Covering arrays of strength three
• Vector sets for exhaustive testing of logic circuits

Cited In (3)

• Title not available (Why is that?)
• Mixed covering of trees and the augmentation problem with odd diameter constraints
• Title not available (Why is that?)

Uses Software

• AETG

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063252)