\(d\)-connectivity of the random graph with restricted budget (Q6657595)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7962413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(d\)-connectivity of the random graph with restricted budget |
scientific article; zbMATH DE number 7962413 |
Statements
\(d\)-connectivity of the random graph with restricted budget (English)
0 references
6 January 2025
0 references
connectivity
0 references
online algorithm
0 references
random graph
0 references
random process
0 references
restricted budget
0 references
sharp threshold
0 references
0.7592952847480774
0 references
0.7523480653762817
0 references
0.7464824318885803
0 references
0.7380914092063904
0 references
