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

Full description

Bibliographic Details

Published in:	Knowledge-based systems Vol. 278; p. 110878
Main Authors:	Yang, Xu, Song, Chao, Gu, Jiqing, Li, Ke, Li, Hongwei
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 25.10.2023
Subjects:	Approximate algorithms Distributed streaming algorithms Streaming graphs Triangle counting Streaming graphs Approximate algorithms Distributed streaming algorithms Triangle counting
ISSN:	0950-7051, 1872-7409
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!