Name
Abstract | ||
|---|---|---|
The authors present an algorithm for finding a minimum spanning tree. They show a typical application of this MST algorithm. Suppose 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. If we consider the points vertices and the dotted lines edges, we have a complete graph on 11 points. If we then choose just ... |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/5992.909004 | Computing in Science & Engineering |
Keywords | Field | DocType |
Tree graphs,Algorithm design and analysis,Joining processes,Circuits,Costs,Chaos | Discrete mathematics,Combinatorics,Distributed minimum spanning tree,Prim's algorithm,Euclidean minimum spanning tree,Connected dominating set,Spanning tree,Reverse-delete algorithm,Kruskal's algorithm,Mathematics,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
3 | 2 | 1521-9615 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Beichl, Isabel | 1 | 63 | 22.58 |
| F. Sullivan | 2 | 10 | 4.93 |