Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (Q3507528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5291171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs |
scientific article; zbMATH DE number 5291171 |
Statements
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (English)
0 references
19 June 2008
0 references
property testing
0 references
graph algorithms
0 references
approximation
0 references
regularity lemma
0 references
0.8455430269241333
0 references
0.8454515933990479
0 references
0.8422412276268005
0 references
0.8270187377929688
0 references
