Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20963 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3090469133 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:43, 19 March 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
