Tight Bounds for Testing Bipartiteness in General Graphs (Q4651520)
From MaRDI portal
scientific article; zbMATH DE number 2135821
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds for Testing Bipartiteness in General Graphs |
scientific article; zbMATH DE number 2135821 |
Statements
Tight Bounds for Testing Bipartiteness in General Graphs (English)
0 references
21 February 2005
0 references
property testing
0 references
bipartiteness
0 references
randomized algorithms
0 references
