A big graph clustering method to support parallel processing by perceiving graph’s application algorithm semantics

As the size of graph data grows exponentially, it is usually processed by parallel and distributed computing environment. During parallel processing, the first step is to divide the graph data into many subgraphs and then place them on different computational nodes. However, the existing graph clust...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of supercomputing Vol. 80; no. 2; pp. 2838 - 2861
Main Authors:	Cheng, Tengteng, Zeng, Guosun, Sun, Zhipeng
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2024 Springer Nature B.V
Subjects:	Algorithms Clustering Communication Compilers Computer Science Distributed processing Graph theory Interpreters Methods Modularity Parallel processing Processor Architectures Programming Languages Semantics Social networks Graph clustering Parallel processing Semantic serial degree Big graph Modularity of a subgraph Graph’s application algorithm
ISSN:	0920-8542, 1573-0484
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!