A greedy algorithm to construct covering arrays using a graph representation (Q2201668): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129015606, #quickstatements; #temporary_batch_1726354825270 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ins.2018.10.048 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.INS.2018.10.048 / rank | |||
Normal rank | |||
Latest revision as of 11:38, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy algorithm to construct covering arrays using a graph representation |
scientific article |
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
