DEABC provides an unbiased estimator for butterfly counts in duplicate-edge streaming bipartite graphs via bucket-based priority sampling, with claimed lower memory use and proven variance bounds compared to FABLE.
Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
DEABC provides an unbiased estimator for butterfly counts in duplicate-edge streaming bipartite graphs via bucket-based priority sampling, with claimed lower memory use and proven variance bounds compared to FABLE.