Triangle counting in dynamic graph streams (Q334947)
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: Triangle counting in dynamic graph streams |
scientific article; zbMATH DE number 6339268
- Triangle Counting in Dynamic Graph Streams
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangle counting in dynamic graph streams |
scientific article; zbMATH DE number 6339268 |
|
Statements
Triangle counting in dynamic graph streams (English)
0 references
Triangle Counting in Dynamic Graph Streams (English)
0 references
1 November 2016
0 references
2 September 2014
0 references
randomized approximation algorithms
0 references
streaming algorithms
0 references
triangle counting
0 references
0 references
1.0000002
0 references
0.96324795
0 references
0.94844145
0 references
0 references
0.9080311
0 references
0.9062174
0 references
