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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Knowledge-based systems Jg. 278; S. 110878
Hauptverfasser:	Yang, Xu, Song, Chao, Gu, Jiqing, Li, Ke, Li, Hongwei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 25.10.2023
Schlagworte:	Approximate algorithms Distributed streaming algorithms Streaming graphs Triangle counting Streaming graphs Approximate algorithms Distributed streaming algorithms Triangle counting
ISSN:	0950-7051, 1872-7409
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!