In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most distributed and parallel graph algorithms in the MPC model are designed for static ...

Abstract: Gannet optimization algorithm (GOA) is a meta-heuristic algorithm based on habits of gannet proposed by Zhang et al. In this paper, we propose a Gannet optimization algorithm using parallel ...

This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a ...

Abstract: A parallel algorithm is presented in this article to efficiently solve the optimal consensus problem of multiagent systems. By utilizing a Jacobi-type proximal alternating direction ...

This Project explores the problem of influence maximization in social networks, which involves finding the most influential users to spread information effectively. Here’s a condensed summary of its ...

The Bellman-Ford algorithm is an important algorithm that computes shortest paths from a single source vertex to all the others in a weighted directed graph. With respect to other algorithms designed ...