Distribution-free connectivity testing for sparse graphs (Q926283)

From MaRDI portal
Revision as of 09:48, 28 June 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
Distribution-free connectivity testing for sparse graphs
scientific article

    Statements

    title
    Distribution-free connectivity testing for sparse graphs (English)
    0 references
    author
    Shirley Halevy
    0 references
    Eyal Kushilevitz
    0 references
    published in
    Algorithmica
    0 references
    publication date
    27 May 2008
    0 references
    zbMATH Keywords
    Property testing
    0 references
    Distribution-free testing
    0 references
    Connectivity testing
    0 references
    Properties of sparse graphs
    0 references
    cites work
    Testing satisfiability
    0 references
    Q5501357
    0 references
    Testing of Clustering
    0 references
    Q4941829
    0 references
    Spot-checkers
    0 references
    Q3152421
    0 references
    Testing juntas
    0 references
    Testing monotonicity
    0 references
    Q4780801
    0 references
    Q4788610
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C40
    0 references
    05C85
    0 references
    zbMATH DE Number
    5279054
    0 references
    OpenAlex ID
    W2046654297
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q926283&oldid=35057904"
    Powered by MediaWiki