Fully-dynamic minimum spanning forest with improved worst-case update time (Q4978053)
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: Fully-dynamic minimum spanning forest with improved worst-case update time |
scientific article; zbMATH DE number 6761884
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully-dynamic minimum spanning forest with improved worst-case update time |
scientific article; zbMATH DE number 6761884 |
Statements
Fully-dynamic minimum spanning forest with improved worst-case update time (English)
0 references
17 August 2017
0 references
dynamic graph connectivity
0 references
dynamic minimum spanning forest
0 references
