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_507

A procedure for finding a minimum spanning tree in a network. The method selects the lowest cost arcs in sequence, while ensuring that no cycles are allowed. Ties are broken arbitrarily. For a network with n nodes, the process stops when n − 1 arcs are selected.  Greedy algorithm;  Minimal spanning tree;  Prim's algorithm.

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