DOI resolved by resea

Shortest Connection Networks And Some Generalizations

The basic problem considered is that of interconnecting a given set of terminals with a shortest possible network of direct links. Simple and practical procedures are given for solving this…

R. C. Prim
https://resea.org/10.1002/j.1538-7305.1957.tb01515.x

Abstract

The basic problem considered is that of interconnecting a given set of terminals with a shortest possible network of direct links. Simple and practical procedures are given for solving this problem both graphically and computationally. It develops that these procedures also provide solutions for a much broader class of problems, containing other examples of practical interest.