A greedy algorithm to construct covering arrays using a graph representation (Q2201668)

From MaRDI portal
Revision as of 00:09, 15 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129015606, #quickstatements; #temporary_batch_1726354825270)
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
    0 references
    0 references

    Identifiers