Dynamic graph connectivity in polylogarithmic worst case time (Q5741790)
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 7055316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic graph connectivity in polylogarithmic worst case time |
scientific article; zbMATH DE number 7055316 |
Statements
Dynamic graph connectivity in polylogarithmic worst case time (English)
0 references
15 May 2019
0 references
0.9232425
0 references
0 references
0.9189341
0 references
0.9187068
0 references
0 references
0.91026634
0 references
0.90707636
0 references
