A two-phase streaming edge partitioning algorithm for large-scale uncertain graphs

Uncertain graphs, which model uncertainty in edges, are used in various domains such as social networks, biological networks, and recommendation systems. As the scale of these graphs continues to grow, efficient distributed analysis becomes crucial, hinging on effective graph partitioning. However,...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cluster computing Ročník 28; číslo 11; s. 746
Hlavní autoři:	Cui, Huanqing, Chang, Anfu, Hu, Kekun, Dong, Gang, Zhu, Jinbin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2025 Springer Nature B.V
Témata:	Algorithms Apexes Clustering Computer Communication Networks Computer Science Graph theory Graphs Load balancing Operating Systems Optimization Partitioning Partitions (mathematics) Probability Probability distribution Processor Architectures Recommender systems Skewness Social networks Uncertainty Graph partitioning Distributed graph computing Uncertain graph Degree advantage
ISSN:	1386-7857, 1573-7543
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!

Buďte první, kdo okomentuje tento záznam!