Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

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

A new open-source library by Nvidia could be the secret ingredient to advancing analytics and making graph databases faster. The key: parallel processing on Nvidia GPUs. Nvidia has long ago stopped ...