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 problem is to find the earliest starting times for all operations. This problem generalizes the shortest path problem and the critical path problem. The complexity of the suggested algorithm is O ...