Covering array on the Cartesian product of hypergraphs

DOI10.1007/S00373-024-02813-5zbMATH Open1544.05089MaRDI QIDQ6581902FDOQ6581902

Authors: Yasmeen Akhtar, Soumen Maity 

Publication date: 1 August 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Mixed covering arrays on 3-uniform hypergraphs
• Covering arrays of strength four and software testing
• Partial covering arrays: algorithms and asymptotics
• Partial covering arrays: algorithms and asymptotics
• Mixed covering arrays on graphs

zbMATH Keywords

approximation algorithmCartesian productcovering arrayCayley hypergraph

Mathematics Subject Classification ID

Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Orthogonal arrays. Theory and applications
• Orthogonal Arrays of Index Unity
• Problems and algorithms for covering arrays
• Hypergraph theory. An introduction
• Über das schwache Kartesische Produkt von Graphen
• The Cartesian product of hypergraphs
• New constructions for IPP codes
• Covering arrays on graphs
• Cayley hypergraphs and Cayley hypermaps
• Mixed covering arrays on 3-uniform hypergraphs
• Software and hardware testing using combinatorial covering suites
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Variable strength covering arrays
• Mixed covering arrays on graphs
• Explicit construction of exponential sized families of k-independent sets
• Vector sets for exhaustive testing of logic circuits
• Introduction to combinatorial testing
• Factorization of products of hypergraphs: Structure and algorithms
• Compressing inconsistent data
• Cayley, Marty and Schreier hypergraphs
• Binary covering arrays on tournaments
• Covering arrays of strength four and software testing
• Cost-efficient mixed-level covering designs for testing experiments
• A hyperedge coloring and application in combinatorial testing
• hClique: An exact algorithm for maximum clique problem in uniform hypergraphs

This page was built for publication: Covering array on the Cartesian product of hypergraphs

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