Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175)
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: Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time |
scientific article; zbMATH DE number 6999429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8976424
0 references
0.8758624
0 references
0.86885726
0 references
0.86265063
0 references
0.85964525
0 references
0 references
0.8557677
0 references
0.8557677
0 references
0.85576546
0 references
