A greedy algorithm to construct covering arrays using a graph representation (Q2201668)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A greedy algorithm to construct covering arrays using a graph representation |
scientific article; zbMATH DE number 7253058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm to construct covering arrays using a graph representation |
scientific article; zbMATH DE number 7253058 |
Statements
A greedy algorithm to construct covering arrays using a graph representation (English)
0 references
29 September 2020
0 references
greedy algorithms
0 references
graphs
0 references
covering arrays
0 references
minimum clique cover
0 references
0.8966546
0 references
0.8868326
0 references
0.87722415
0 references
0.8756518
0 references
0.8691417
0 references
0 references
