An efficient noisy binary search in graphs via Median approximation (Q2115863)

From MaRDI portal
Revision as of 09:30, 28 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient noisy binary search in graphs via Median approximation
scientific article

    Statements

    An efficient noisy binary search in graphs via Median approximation (English)
    0 references
    22 March 2022
    0 references
    graph median
    0 references
    graph searching
    0 references
    noisy search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers