Bipartite locating array (Q2287790)

From MaRDI portal
Revision as of 21:27, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126460303, #quickstatements; #temporary_batch_1722284575798)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bipartite locating array
scientific article

    Statements

    Bipartite locating array (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2020
    0 references
    A locating array is a special experimental design which is useful for locating interaction faults in component-based systems. Bipartite locating array is a generalization to locating array and is typically useful to locate interaction faults between two specific groups. When a single fault is to be located, the authors present a lower bound of the size of a bipartite locating array. This lower bound is used to find optimal bipartite locating arrays. If this lower bound is an interger the authors provide combinatorical construction methods for optimal bipartite locating arrays.
    0 references
    bipartite locating arrays
    0 references
    interaction faults
    0 references
    lower bound
    0 references
    optimality
    0 references

    Identifiers