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

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Towards efficient algorithms on compressed graph databases Abstract: The speed of algorithms on massive graphs depends on the size of the given data. Grammar-based compression is a technique to ...