Disjoint Spread Systems and Fault Location
From MaRDI portal
Publication:2830441
DOI10.1137/16M1056390zbMath1348.05045arXiv2101.01318OpenAlexW3120790331MaRDI QIDQ2830441
Charles J. Colbourn, Daniel Horsley, Bing Li Fan
Publication date: 28 October 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.01318
Optimal statistical designs (62K05) Searching and sorting (68P10) Partitions of sets (05A18) Other designs, configurations (05B30) Extremal combinatorics (05D99)
Related Items (6)
On a combinatorial framework for fault characterization ⋮ Extremal Uniquely Resolvable Multisets ⋮ More constructions for Sperner partition systems ⋮ New bounds on the maximum size of Sperner partition systems ⋮ On almost-regular edge colourings of hypergraphs ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum average-case queries of \(q+1\)-ary search game with small sets
- Optimal locating arrays for at most two faults
- On the edge-colouring problem for unions of complete uniform hypergraphs
- The edge-coloring of complete hypergraphs. I
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Optimality and constructions of locating arrays
- Sperner capacities
- Locating and detecting arrays for interaction faults
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- A Sperner-type theorem for set-partition systems
- Sperner Partition Systems
- A survey of combinatorial testing
- Detachments of Hypergraphs I: The Berge–Johnson Problem
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An Inequality on Binomial Coefficients
- On the Edge-Coloring Property for the Closure of the Complete Hypergraphs
- Products of mixed covering arrays of strength two
- On separating systems of a finite set
This page was built for publication: Disjoint Spread Systems and Fault Location
