In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...
A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback