Faster worst case deterministic dynamic connectivity (Q4606324)
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 6846424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster worst case deterministic dynamic connectivity |
scientific article; zbMATH DE number 6846424 |
Statements
2 March 2018
0 references
dynamic graph
0 references
spanning tree
0 references
Faster worst case deterministic dynamic connectivity (English)
0 references
0.9192302823066713
0 references
0.8774168491363525
0 references
0.8487691283226013
0 references
0.8465312719345093
0 references
