English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams

MPS-Authors
/persons/resource/persons228540

Terolli,  Erisa
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

De Stefani, L., Terolli, E., & Upfal, E. (2021). Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams. ACM Transactions on Knowledge Discovery from Data, 15(5): 79, pp. 1-52. doi:10.1145/3441299.


Cite as: https://hdl.handle.net/21.11116/0000-0008-ED51-2
Abstract
There is no abstract available