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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gloor, P. (1997). Cybertrees:Tree — Shaped Overview Maps. In: Elements of Hypermedia Design: Techniques for Navigation & Visualization in Cyberspace. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-4144-7_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4144-7_21
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3911-2
Online ISBN: 978-1-4612-4144-7
eBook Packages: Springer Book Archive