A tight upper bound for group testing in graphs (Q1315459)

From MaRDI portal
Revision as of 18:16, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A tight upper bound for group testing in graphs
scientific article

    Statements

    A tight upper bound for group testing in graphs (English)
    0 references
    0 references
    15 May 1994
    0 references
    group testing
    0 references
    upper bound
    0 references
    efficient algorithm
    0 references

    Identifiers