Dynamic graph stream algorithms in \(o(n)\) space (Q4598151)
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 6820207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic graph stream algorithms in \(o(n)\) space |
scientific article; zbMATH DE number 6820207 |
Statements
19 December 2017
0 references
dynamic graph streams
0 references
sketching
0 references
property testing
0 references
minimum spanning tree
0 references
0.9974862933158876
0 references
0.8594847321510315
0 references
0.8402175903320312
0 references
0.8269001245498657
0 references
