Algorithms for layout of disconnected graphs
Proceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000
539 - 542
Item Usage Stats
MetadataShow full item record
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.