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

This is a preview. Log in through your library . Abstract Our main contribution is an O(n log n) algorithm that determines with high probability a perfect matching in a random 2-out bipartite graph.