Binary Covering Arrays and Existentially Closed Graphs
From MaRDI portal
Publication:5322995
DOI10.1007/978-3-642-01877-0_3zbMath1248.05034OpenAlexW1526335077MaRDI QIDQ5322995
Gerzson Kéri, Charles J. Colbourn
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01877-0_3
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Structural characterization of families of graphs (05C75) Combinatorial aspects of packing and covering (05B40)
Related Items (6)
Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ On Symmetric Designs and Binary 3-Frameproof Codes ⋮ Covering arrays, augmentation, and quilting arrays ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ Covering and radius-covering arrays: constructions and classification
Uses Software
Cites Work
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Classification algorithms for codes and designs
- Constraint models for the covering test problem
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Tabu search for covering arrays using permutation vectors
- The smallest graphs with certain adjacency properties
- Approximating probability distributions using small sample spaces
- Classification of Hadamard matrices of order 28
- A characterization of span program size and improved lower bounds for monotone span programs
- Upper bounds for covering arrays by tabu search.
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- Superpolynomial lower bounds for monotone span programs
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Steiner triple systems and existentially closed graphs
- Applications of matrix methods to the theory of lower bounds in computational complexity
- On the state of strength-three covering arrays
- Properties of almost all graphs and complexes
- Iterative Exhaustive Pattern Generation for Logic Testing
- Hadamard matrices of order 36 with automorphisms of order 17
- Paley graphs satisfy all first-order adjacency axioms
- On an adjacency property of graphs
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Simple Constructions of Almost k-wise Independent Random Variables
- Schttes Tournament Problem and Intersecting Families of Sets
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Covering arrays and intersecting codes
- A note on graphs with a prescribed adjacency property
- On the adjacency properties of paley graphs
- On a Problem of Schütte and Erdös
- Covering arrays of higher strength from permutation vectors
- A Constructive Solution to a Tournament Problem
- On a Problem in Graph Theory
- Asymmetric graphs
- On an adjacency property of almost all graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Binary Covering Arrays and Existentially Closed Graphs
