← Back to all posts
A major leap for the four-color problem
🗺️

A major leap for the four-color problem

Here’s a lovely update from the world of mathematics: researchers have found a much faster way to solve the famous four-color problem. Although the theorem was proved in 1976, finding an efficient algorithm has continued to challenge mathematicians. After a decade of work, an international team discovered many more useful starting points in map-like graphs, improving the algorithm from quadratic to linear time. That means maps with ten times as many regions take only about ten times longer to process, and the approach may also work on surfaces with holes.
Read the original article ↗
Share