Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

Physics and Python stuff. Most of the videos here are either adapted from class lectures or solving physics problems. I really like to use numerical calculations without all the fancy programming ...

ABSTRACT: With the deepening of global economic integration, maritime logistics has become the core pillar of international trade, carrying more than 80% of global trade volume. Among the factors ...

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

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 the easiest pieces first. But this kind of sorting has a cost.

Google’s June 2025 Core Update just finished. What’s notable is that while some say it was a big update, it didn’t feel disruptive, indicating that the changes may have been more subtle than game ...

Abstract: We investigate the problem of learning the trustworthiness of agents in a directed graph, where agents receive stochastic trust information about their in-neighbors. We consider a setting ...

Finding the shortest path in a network is a classical problem, and a variety of search strategies have been proposed to solve it. In this paper, we review traditional approaches for finding shortest ...

Abstract: We consider the Max Directed 3-Section problem, which is closely connected to other well-known graph partition problems, such as Max Cut and Max Bisection. Given an arc-weighted directed ...