A combinatorial characterization of the testable graph properties, it's all about regularity (Q2931390)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinatorial characterization of the testable graph properties, it's all about regularity |
scientific article; zbMATH DE number 6373897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial characterization of the testable graph properties, it's all about regularity |
scientific article; zbMATH DE number 6373897 |
Statements
A combinatorial characterization of the testable graph properties (English)
0 references
25 November 2014
0 references
characterization
0 references
property testing
0 references
regularity lemma
0 references
0.993111789226532
0 references
0.8468348979949951
0 references
0.8437738418579102
0 references
0.8392091989517212
0 references
