A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

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

If you wanted to show the effects of parallelization on the speed of a sort, and could only pick one algorithm to demonstrate this, which would it be? I have found quite a few that lend themselves to ...

So-called 'external memory' sorting algorithms generally look very different from in-core algorithms. IIRC, the efficient way involves setting up a 'funnel' of input data streams, and writing out ...