FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams

DOI10.1007/s10618-019-00630-6zbMath1458.68283arXiv1611.06615OpenAlexW2554164694WikidataQ128015152 ScholiaQ128015152MaRDI QIDQ2218366

Yongsub Lim, U. Kang, Sunmin Lee, Min-Soo Jung

Publication date: 15 January 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.06615

zbMATH Keywords

edge samplinggraph streamlocal triangle counting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Uses Software

• DOULION

Cites Work

• Unnamed Item
• Colorful triangle counting and a \textsc{MapReduce} implementation
• Finding and counting given length cycles
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Probabilistic counting algorithms for data base applications
• Min-wise independent permutations
• Computational Statistics
• Random sampling with a reservoir

This page was built for publication: FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams