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

De Stefani, Lorenzo; Terolli, Erisa; Upfal, Eli

doi:10.1145/3441299

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0008-ED51-2 Version Permalink: https://hdl.handle.net/21.11116/0000-0008-ED52-1

Genre: Journal Article

Latex : Tiered Sampling: {A}n Efficient Method for Counting Sparse Motifs in Massive Graph Streams

Files

show Files

Locators

show

Creators

show

hide

Creators:
De Stefani, Lorenzo¹, Author
Terolli, Erisa², Author
Upfal, Eli¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2021Date issued: 2021

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1145/3441299
BibTex Citekey: DeStefani2021

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: ACM Transactions on Knowledge Discovery from Data

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : ACM

Pages: - Volume / Issue: 15 (5) Sequence Number: 79 Start / End Page: 1 - 52 Identifier: ISSN: 1556-4681