In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

Here is a problem I'm working on. Say you have a weighted, directed graph with n vertices and m edges, and you want to find the shortest path from s to all other vertices, *but* you can only use some ...

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