A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity (Q5189542): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105584121, #quickstatements; #temporary_batch_1704809102140 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/060667177 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016987856 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:22, 19 March 2024
scientific article; zbMATH DE number 5682429
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity |
scientific article; zbMATH DE number 5682429 |
Statements
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity (English)
0 references
17 March 2010
0 references
property testing
0 references
regularity Lemma
0 references
characterization
0 references
testable graph properties
0 references
