A distributed streaming framework for edge–cloud triangle counting in graph streams

The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other fields. However, cloud computing based streaming algorithms cause high bandwidth occupation and long transmission latency due to limited bandwidth...

Celý popis

Podrobná bibliografia

Vydané v:	Knowledge-based systems Ročník 278; s. 110878
Hlavní autori:	Yang, Xu, Song, Chao, Gu, Jiqing, Li, Ke, Li, Hongwei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 25.10.2023
Predmet:	Approximate algorithms Distributed streaming algorithms Streaming graphs Triangle counting Streaming graphs Approximate algorithms Distributed streaming algorithms Triangle counting
ISSN:	0950-7051, 1872-7409
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!