Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time (Q4978052)
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: Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time |
scientific article; zbMATH DE number 6761883
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time |
scientific article; zbMATH DE number 6761883 |
Statements
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time (English)
0 references
17 August 2017
0 references
dynamic spanning forest
0 references
graph decomposition
0 references
local graph partitioning
0 references
sparse recovery
0 references
