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á bibliografie

Vydáno v:	Knowledge-based systems Ročník 278; s. 110878
Hlavní autoři:	Yang, Xu, Song, Chao, Gu, Jiqing, Li, Ke, Li, Hongwei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 25.10.2023
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!