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