Two-dimensional packing algorithms for layout of disconnected graphs

Simple item page
dc.citation.epage158en_US
dc.citation.issueNumber1-4en_US
dc.citation.spage147en_US
dc.citation.volumeNumber143en_US
dc.contributor.authorDogrusoz, U.en_US
dc.date.accessioned2016-02-08T10:33:02Z
dc.date.available2016-02-08T10:33:02Zen_US
dc.date.issued2002en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they perform well are analyzed. © 2002 Elsevier Science Inc. All rights reserved.en_US
dc.identifier.doi10.1016/S0020-0255(02)00183-4en_US
dc.identifier.issn0020-0255
dc.identifier.issn1872-6291
dc.identifier.urihttp://hdl.handle.net/11693/24693en_US
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/S0020-0255(02)00183-4en_US
dc.source.titleInformation Sciencesen_US
dc.subjectGraph Layouten_US
dc.subjectGraph Visualizationen_US
dc.subjectTwo-Dimensional Packingen_US
dc.subjectAlgorithmsen_US
dc.subjectAspect Ratioen_US
dc.subjectComputer Simulationen_US
dc.subjectGraph Theoryen_US
dc.subjectGraph Layoutsen_US
dc.subjectGraph Visualizationen_US
dc.subjectInformation Analysisen_US
dc.titleTwo-dimensional packing algorithms for layout of disconnected graphsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Two-dimensional packing algorithms for layout of disconnected graphs.pdf
Size:
465.1 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Computer Engineering