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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of supercomputing Jg. 80; H. 2; S. 2838 - 2861
Hauptverfasser: Cheng, Tengteng, Zeng, Guosun, Sun, Zhipeng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.01.2024
Springer Nature B.V
Schlagworte:
ISSN:0920-8542, 1573-0484
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!