Masoud Sagharichian

According to our database, Masoud Sagharichian authored at least 6 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2023

iPartition: a distributed partitioning algorithm for block-centric graph processing systems.

Masoud Sagharichian, Morteza Alipour Langouri

J. Supercomput., December, 2023

2017

A fast method to exactly calculate the diameter of incremental disconnected graphs.

Masoud Sagharichian, Morteza Alipour Langouri, Hassan Naderi

World Wide Web, 2017

Intelligent and independent processes for overcoming big graphs.

Masoud Sagharichian, Hassan Naderi

J. Supercomput., 2017

Connected components of big graphs in fixed MapReduce rounds.

Reihane Abdolazimi, Hassan Naderi, Masoud Sagharichian

Clust. Comput., 2017

2016

Calculating Exact Diameter Metric of Large Static Graphs.

Masoud Sagharichian, Morteza Alipour Langouri, Hassan Naderi

J. Univers. Comput. Sci., 2016

2015

ExPregel: a new computational model for large-scale graph processing.

Masoud Sagharichian, Hassan Naderi, M. Haghjoo

Concurr. Comput. Pract. Exp., 2015