Dynamic graph stream algorithms in \(o(n)\) space (Q1741857)
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 graph stream algorithms in \(o(n)\) space |
scientific article; zbMATH DE number 7051772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic graph stream algorithms in \(o(n)\) space |
scientific article; zbMATH DE number 7051772 |
Statements
Dynamic graph stream algorithms in \(o(n)\) space (English)
0 references
7 May 2019
0 references
dynamic graph streams
0 references
graph sketching
0 references
property testing
0 references
minimum spanning tree
0 references
0 references
0 references
0.91604155
0 references
0.9066361
0 references
0 references
0.89252096
0 references
0.8915234
0 references
0.8908313
0 references
0.8898911
0 references
0.8896047
0 references
