Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520)
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: Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process |
scientific article; zbMATH DE number 7290194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process |
scientific article; zbMATH DE number 7290194 |
Statements
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (English)
0 references
5 January 2021
0 references
embedding spanning graphs
0 references
semi-random graph process
0 references
0.99999976
0 references
0.8711657
0 references
0.8685902
0 references
0.86631715
0 references
0.8649756
0 references
0.8647031
0 references
0 references
0.8586393
0 references
