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 ...

This paper considers the shortest path problem with waiting costs (SPWC) as an extension to the shortest path problem with time windows. The problem consists of finding the minimum cost path in a ...