Finding cycles and trees in sublinear time (Q2925521): Difference between revisions
From MaRDI portal
Latest revision as of 03:55, 9 July 2024
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
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