Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris


  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_793

A procedure for finding a minimum spanning tree in a network. The method starts from any node and connects it to the node nearest to it. Then, for those nodes that are now connected, the unconnected node that is closest to one of the nodes in the connected set is found and connected to these closest nodes. The process continues until all nodes are connected. Ties are broken arbitrarily.  Greedy algorithm;  Kruskal's algorithm;  Minimam spanning tree.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA