Doğrusöz, Uğur2016-02-082016-02-082000http://hdl.handle.net/11693/27636Conference name: Proceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000We 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.EnglishGraph drawingsGraph layoutAlgorithmsAspect ratioGraph theoryInformation analysisProblem solvingRotationSet theoryComputer scienceConference Paper