Finding cycles and trees in sublinear time (Q2925521)

From MaRDI portal
Revision as of 13:34, 23 August 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
Finding cycles and trees in sublinear time
scientific article

    Statements

    Finding cycles and trees in sublinear time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2014
    0 references
    sublinear-time algorithms
    0 references
    property testing
    0 references
    bounded-degree graphs
    0 references
    one-sided versus two-sided error probability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references