Two-dimensional packing algorithms for layout of disconnected graphs
147 - 158
Item Usage Stats
MetadataShow full item record
We 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.
Published Version (Please cite this version)http://dx.doi.org/10.1016/S0020-0255(02)00183-4
Showing items related by title, author, creator and subject.
Akbudak K.; Aykanat, C. (IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...
Eser, Elif; Kocayusufoğlu, F.; Eravci, Bahaedd; Ferhatosmanoglu, Hakan; Larriba-Pey, J. L. (IEEE, 2016-12)While research on time-varying graphs has attracted recent attention, the research community has limited or no access to real datasets to develop effective algorithms and systems. Using noisy and sparse GPS traces from ...
Dogrusoz, U.; Belviranli, M. E.; Dilek, A. (Institute of Electrical and Electronics Engineers, 2013)We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring ...