Sequence covering arrays
From MaRDI portal
Publication:5408596
Recommendations
Cited in
(14)- Perfect sequence covering arrays
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Sequence Covering Arrays and Linear Extensions
- Covering arrays from \(m\)-sequences and character sums
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs
- A group-based structure for perfect sequence covering arrays
- Growth of the perfect sequence covering array number
- On perfect sequence covering arrays
- Subsequence covers of words
- Covering arrays with mixed alphabet sizes
- A polynomial construction of perfect sequence covering arrays
- Perfect and nearly perfect separation dimension of complete and random graphs
- Separation dimension of graphs and hypergraphs
This page was built for publication: Sequence covering arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408596)