Algorithms for layout of disconnected graphs
Date
2000
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000
Print ISSN
Electronic ISSN
Publisher
Elsevier
Volume
Issue
Pages
539 - 542
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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.