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

This is a preview. Log in through your library . Abstract We consider the shortest paths between all pairs of nodes in a directed or undirected complete graph with edge lengths which are uniformly and ...

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...