Algorithms for layout of disconnected graphs
Author(s)
Date
2000Source Title
Proceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000
Publisher
Elsevier
Pages
539 - 542
Language
English
Type
Conference PaperItem Usage Stats
106
views
views
26
downloads
downloads
Abstract
We present efficient algorithms for the layout of disconnected objects in a graph (isolated nodes and components) for a specified aspect ratio. These linear and near-linear algorithms are based on alternate-bisection and two-dimensional packing methodologies. In addition, the parameters that affect the performance of these algorithms as well as the circumstances under which the two methodologies perform well are analyzed.
Keywords
Graph drawingsGraph layout
Algorithms
Aspect ratio
Graph theory
Information analysis
Problem solving
Rotation
Set theory
Computer science