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

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

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

The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...

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

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.