Faster randomized worst-case update time for dynamic subgraph connectivity (Q2405295)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster randomized worst-case update time for dynamic subgraph connectivity |
scientific article |
Statements
Faster randomized worst-case update time for dynamic subgraph connectivity (English)
0 references
22 September 2017
0 references
