Covering array on the Cartesian product of hypergraphs
From MaRDI portal
Publication:6581902
DOI10.1007/s00373-024-02813-5zbMATH Open1544.05089MaRDI QIDQ6581902
Publication date: 1 August 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Explicit construction of exponential sized families of k-independent sets
- Orthogonal arrays. Theory and applications
- Cayley, Marty and Schreier hypergraphs
- Binary covering arrays on tournaments
- New constructions for IPP codes
- Problems and algorithms for covering arrays
- Cayley hypergraphs and Cayley hypermaps
- Factorization of products of hypergraphs: Structure and algorithms
- Hypergraph theory. An introduction
- Cost-efficient mixed-level covering designs for testing experiments
- Covering arrays on product graphs
- Mixed covering arrays on 3-uniform hypergraphs
- Über das schwache Kartesische Produkt von Graphen
- Covering arrays on graphs
- The Cartesian product of hypergraphs
- Vector sets for exhaustive testing of logic circuits
- Variable strength covering arrays
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- Compressing inconsistent data
- A hyperedge coloring and application in combinatorial testing
- Mixed covering arrays on graphs
- Orthogonal Arrays of Index Unity
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)
