A competitive algorithm in searching for many edges in a hypergraph (Q869578)

From MaRDI portal
Revision as of 06:17, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A competitive algorithm in searching for many edges in a hypergraph
scientific article

    Statements

    A competitive algorithm in searching for many edges in a hypergraph (English)
    0 references
    0 references
    0 references
    8 March 2007
    0 references
    competitive algorithm
    0 references
    hypergraph
    0 references
    edge-searching problem
    0 references
    group testing
    0 references
    graph searching
    0 references

    Identifiers