Through a Summer Undergraduate Research Fellowship, Jenny Quan is exploring the mathematical principles behind Rubik's cubes.

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

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

Abstract: Graph theory is a powerful tool for addressing problems involving discrete structures, such as determining the shortest length of connected river networks or the shortest distance between ...

Abstract: Shortest path mining is one of the classic problems in graph theory. How to design an efficient multi-source shortest paths mining algorithm has practical significance. In this article, an ...

The Department of Marine Technology, Ocean University of China, Qingdao, China Coverage path planning (CPP) for target search by autonomous unmanned vehicle (AUV) involves two crucial aspects: (1) the ...

Dijkstra’s algorithm is great as long as we have no negative weight edges in our graph. But there are many problems for which it is natural to represent weights with positive and negative values—gains ...

Throwing the deep ball to wide receiver Calvin Ridley hasn’t been a very productive strategy for the Titans this season. So in their continuing efforts to get the ball in Ridley’s hands, the Titans ...

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