An algorithmic version of the blow-up lemma (Q4240605)
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: An algorithmic version of the blow-up lemma |
scientific article; zbMATH DE number 1281308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic version of the blow-up lemma |
scientific article; zbMATH DE number 1281308 |
Statements
2 August 1999
0 references
regularity lemma
0 references
blow-up lemma
0 references
bounded degree spanning subgraphs
0 references
algorithm
0 references
An algorithmic version of the blow-up lemma (English)
0 references
0.91864765
0 references
0.8994516
0 references
0.8711559
0 references
0.8662274
0 references
0.86540514
0 references
