Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175)
From MaRDI portal
scientific article; zbMATH DE number 6999429
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time |
scientific article; zbMATH DE number 6999429 |
Statements
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (English)
0 references
10 January 2019
0 references
random graph
0 references
neighborhood search
0 references
giant component
0 references
dynamic algorithm
0 references
connectivity query
0 references
0 references
