论文信息 - Two-dimensional packing algorithms for layout of disconnected graphs

Two-dimensional packing algorithms for layout of disconnected graphs

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.

Ugur Dogrusöz | Ugur Dogrusöz

[1] Edward G. Coffman,et al. Packings in two dimensions: Asymptotic average-case analysis of algorithms , 1993, Algorithmica.

[2] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[3] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[4] Richard E. Korf,et al. From Approximate to Optimal Solutions: A Case Study of Number Partitioning , 1995, IJCAI.

[5] G. S. Lueker,et al. Probabilistic analysis of optimum partitioning , 1986, Journal of Applied Probability.

[6] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[7] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[8] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.