Advertisement

Abstract

This chapter introduces two algorithms, CREATE-LOCAL-TREES and CREATE-GLOBAL-TREE, based on Kruskal’s minimum spanning tree (m.s.t.) algorithm [Cor90]. Kruskal’s algorithm builds an m.s.t. by growing a forest. It adds unconnected edges with the heighest weight to the tree until all nodes are connected. By omitting tree-connecting links in Kruskal’s algorithm, we get a clustering in local trees; inclusion of the tree-connecting links results in one global tree.

Keywords

Local Tree Minimum Span Tree Node Size Tree Shape Global Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Peter Gloor

There are no affiliations available

Personalised recommendations