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 important insight is that for repetition codes, this results in what's called a planar graph, where edges don't cross each other. "This allows us to exploit the exact, efficient solutions for ...