Cargando…
Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs
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 c...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9813377/ https://www.ncbi.nlm.nih.gov/pubmed/36599906 http://dx.doi.org/10.1038/s41598-022-25243-w |