A Parallel Algorithm for Community Detection in Social Networks, Based on Path Analysis and Threaded Binary Trees
Several synchronous applications are based on the graph-structured data; among them, a very important application of this kind is community detection. Since the number and size of the networks modeled by graphs grow larger and larger, some level of parallelism needs to be used, to reduce the computa...
Main Authors: | Stavros Souravlas, Angelo Sifaleras, Stefanos Katsavounis |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8636962/ |
Similar Items
-
Hybrid CPU-GPU Community Detection in Weighted Networks
by: Stavros Souravlas, et al.
Published: (2020-01-01) -
A Novel, Interdisciplinary, Approach for Community Detection Based on Remote File Requests
by: Stavros Souravlas, et al.
Published: (2018-01-01) -
Full Binary Tree-Based Fixed Degree Graph Design and Parallel Algorithm
by: Bo Ok Seong, et al.
Published: (2023-01-01) -
A Survey on the Recent Advances of Deep Community Detection
by: Stavros Souravlas, et al.
Published: (2021-08-01) -
A Suggested Point Search Algorithm for Circle Detection in Binary Images
by: Sundus Ebraheem
Published: (2010-12-01)