Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520): Difference between revisions
From MaRDI portal
Latest revision as of 07:17, 24 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process |
scientific article |
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