Accès ouvert · CC BY

Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs

Article scientifique 2023 Sciences physiques et chimiques Anglais

Résumé

Counting number of triangles in the graph is considered a major task in many large-scale graph analytics problems such as clustering coefficient, transitivity ratio, trusses, etc. In recent years, MapReduce becomes one of the most popular and powerful frameworks for analyzing large-scale graphs in clusters of machines. In this paper, we propose two new MapReduce algorithms based on graph partitioning. The two algorithms avoid the problem of duplicate counting triangles that other algorithms suffer from. The experimental results show a high efficiency of the two algorithms in comparison with an existing algorithm, overcoming it in the execution time performance, especially in very large-scale graphs.

Citer ce document

Sharafeldeen, A., Alrahmawy, M., & Elmougy, S. (2023). Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs. Scientific Reports. https://doi.org/10.1038/s41598-022-25243-w

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 10/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 14

Téléchargements (hors robots) : 0

Méthode de comptage