Mixed covering arrays on graphs of small treewidth

DOI10.1142/S1793830921500853MaRDI QIDQ5063252zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matchingedge covercovering arrays

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 1556750 (Why is no real title available?)
• Mixed covering of trees and the augmentation problem with odd diameter constraints
• scientific article; zbMATH DE number 5556019 (Why is no real title available?)

Describes a project that uses

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)