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

An algorithm that runs in network bridges and switches to prevent loops, in which packets keep going around in circles. In a small network with one or two switches, the spanning tree protocol (STP ...

You use an algorithm called the spanning tree protocol — just one of the contributions to computer science of a remarkable engineer, Dr. Radia Perlman.