Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications. This paper proposes a minimum spanning tree algorithm using Prim’s approach ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.