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

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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

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.

The original version of this story appeared in Quanta Magazine. If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a ...

I'm sitting here, and doing some homework, flow networks. And a question lead me to think, how to determine if a shortest-path is unique (I want to know is a min-cut is unique). This is standard ...

Jo Craig (they/them) is a Feature Writer from Scotland and has been in the industry for nearly a decade and finds dissecting Marvel trailers for hours standard practice and still finds time to review, ...

Rineke Dijkstra makes photographs and sometimes videos of people who are brave. Sometimes they’re adolescents, sometimes soldiers, sometimes bullfighters. The brave person we see here is called Julie.