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

Ahmed Sharafeldeen, Mohammed Alrahmawy, Samir Elmougy

Open source

DOI
10.1038/s41598-022-25243-w
Published
2023-01-04
Container
Scientific Reports
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1038/s41598-022-25243-w,
  title = {Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs},
  author = {Ahmed Sharafeldeen and Mohammed Alrahmawy and Samir Elmougy},
  year = {2023},
  journal = {Scientific Reports},
  doi = {10.1038/s41598-022-25243-w},
  url = {https://doi.org/10.1038/s41598-022-25243-w}
}

RIS

TY  - JOUR
TI  - Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs
AU  - Ahmed Sharafeldeen
AU  - Mohammed Alrahmawy
AU  - Samir Elmougy
PY  - 2023
JO  - Scientific Reports
DO  - 10.1038/s41598-022-25243-w
UR  - https://doi.org/10.1038/s41598-022-25243-w
ER  - 

APA

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

Source records