Binary Covering Arrays and Existentially Closed Graphs
DOI10.1007/978-3-642-01877-0_3zbMATH Open1248.05034OpenAlexW1526335077MaRDI QIDQ5322995FDOQ5322995
Authors: Charles J. Colbourn, Gerzson Kéri 
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
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Structural characterization of families of graphs (05C75) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Problems and algorithms for covering arrays
- Simple Constructions of Almost k-wise Independent Random Variables
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Covering arrays and intersecting codes
- Classification algorithms for codes and designs
- Applications of matrix methods to the theory of lower bounds in computational complexity
- On an adjacency property of almost all graphs
- On the adjacency properties of paley graphs
- Asymmetric graphs
- Superpolynomial lower bounds for monotone span programs
- A Constructive Solution to a Tournament Problem
- On a Problem in Graph Theory
- Iterative Exhaustive Pattern Generation for Logic Testing
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- On \(t\)-covering arrays
- On the state of strength-three covering arrays
- Software and hardware testing using combinatorial covering suites
- Title not available (Why is that?)
- Distributing hash families and covering arrays
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Upper bounds for covering arrays by tabu search.
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- Tabu search for covering arrays using permutation vectors
- Steiner triple systems and existentially closed graphs
- Covering arrays of higher strength from permutation vectors
- Classification of Hadamard matrices of order 28
- Constraint models for the covering test problem
- A characterization of span program size and improved lower bounds for monotone span programs
- Title not available (Why is that?)
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Title not available (Why is that?)
- Properties of almost all graphs and complexes
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Paley graphs satisfy all first-order adjacency axioms
- On an adjacency property of graphs
- Title not available (Why is that?)
- A note on graphs with a prescribed adjacency property
- Hadamard matrices of order 36 with automorphisms of order 17
- Recursive constructions of covering arrays
- Approximating probability distributions using small sample spaces
- Title not available (Why is that?)
- On a Problem of Schütte and Erdös
- The smallest graphs with certain adjacency properties
- Title not available (Why is that?)
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Schttes Tournament Problem and Intersecting Families of Sets
Cited In (7)
- Covering arrays from cyclotomy
- Suitable permutations, binary covering arrays, and Paley matrices
- Covering and radius-covering arrays: constructions and classification
- Binary covering arrays on tournaments
- Covering arrays, augmentation, and quilting arrays
- Randomized post-optimization of covering arrays
- On symmetric designs and binary 3-frameproof codes
Uses Software
This page was built for publication: Binary Covering Arrays and Existentially Closed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322995)
