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

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

Sometimes, wrapping your head around mathematical concepts can be tricky without a visual aid. Thankfully we have makers like ...

Mathematics of Operations Research, Vol. 38, No. 2 (May 2013), pp. 209-227 (19 pages) We consider a totally asynchronous stochastic approximation algorithm, Q-learning, for solving finite space ...

The objective of this study is to develop a shortest augmenting path algorithm for solving the semi-assignment problem and conduct an extensive computational comparison with the best alternative ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...