CiSE 2001 Issue No. 2 - March/April Abstract - In Order to Form a More Perfect UNION
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Isabel Beichl Articles by Francis Sullivan
In Order to Form a More Perfect UNION
March/April 2001 (vol. 3 no. 2)
pp. 60-64
 ASCII Text x Isabel Beichl, Francis Sullivan, "In Order to Form a More Perfect UNION," Computing in Science and Engineering, vol. 3, no. 2, pp. 60-64, March/April, 2001.
 BibTex x @article{ 10.1109/5992.909004,author = {Isabel Beichl and Francis Sullivan},title = {In Order to Form a More Perfect UNION},journal ={Computing in Science and Engineering},volume = {3},number = {2},issn = {1521-9615},year = {2001},pages = {60-64},doi = {http://doi.ieeecomputersociety.org/10.1109/5992.909004},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - MGZNJO - Computing in Science and EngineeringTI - In Order to Form a More Perfect UNIONIS - 2SN - 1521-9615SP60EP64EPD - 60-64A1 - Isabel Beichl, A1 - Francis Sullivan, PY - 2001VL - 3JA - Computing in Science and EngineeringER -
In this computing prescription we present an algorithm for finding a minimum spanning tree. Figure 1 shows a typical application of this MST algorithm. Here we have 11 data points in a plane and would like to find some structure among them. Suppose we draw dotted lines between each pair of points (see Figure 1a). If we consider the points vertices and the dotted lines edges, we have a complete graph on 11 points. In Figure 1b, we choose just enough of the edges to keep the graph connected. This is a spanning tree of the graph. A graph can have many spanning trees. The one shown is an MST--that is, a spanning tree that minimizes the total length of edges.
Citation:
Isabel Beichl, Francis Sullivan, "In Order to Form a More Perfect UNION," Computing in Science and Engineering, vol. 3, no. 2, pp. 60-64, March-April 2001, doi:10.1109/5992.909004