Show simple item record

dc.contributor.authorDoğrusöz, Uğuren_US
dc.coverage.spatialAtlantic City, NJ, USA
dc.date.accessioned2016-02-08T11:58:29Z
dc.date.available2016-02-08T11:58:29Z
dc.date.issued2000en_US
dc.identifier.urihttp://hdl.handle.net/11693/27636
dc.descriptionConference name: Proceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000
dc.description.abstractWe 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.en_US
dc.language.isoEnglishen_US
dc.source.titleProceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000en_US
dc.subjectGraph drawingsen_US
dc.subjectGraph layouten_US
dc.subjectAlgorithmsen_US
dc.subjectAspect ratioen_US
dc.subjectGraph theoryen_US
dc.subjectInformation analysisen_US
dc.subjectProblem solvingen_US
dc.subjectRotationen_US
dc.subjectSet theoryen_US
dc.subjectComputer scienceen_US
dc.titleAlgorithms for layout of disconnected graphsen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage539en_US
dc.citation.epage542en_US
dc.publisherElsevier


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record