SCOPUS 정보 검색 플랫폼

Volumn 143, Issue 1-4, 2002, Pages 147-158

Two-dimensional packing algorithms for layout of disconnected graphs

Author keywords

Graph layout; Graph visualization; Two dimensional packing

Indexed keywords

ALGORITHMS; ASPECT RATIO; COMPUTER SIMULATION; GRAPH THEORY;

GRAPH LAYOUTS; GRAPH VISUALIZATION;

INFORMATION ANALYSIS;

EID: 0036605140 PISSN: 00200255 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0255(02)00183-4 Document Type: Article

Times cited : (9)

References (8)

1
- 43949160006
- Algorithms for drawing graphs: An annotated bibliography
- (1994) Comput. Geom. Theory Appl. , vol.4 , pp. 235-282
- Di Battista, G.¹ Eades, P.² Tamassia, R.³ Tollis, I.G.⁴

2
- 0000586245
- Performance bounds for level-oriented two-dimensional packing algorithms
- (1990) SIAM J. Comput. , vol.9 , Issue.4 , pp. 808-826
- Coffman, E.G.¹ Garey, M.R.² Johnson, D.S.³ Tarjan, R.E.⁴

3
- 0001363775
- Orthogonal packings in two dimensions
- (1980) SIAM J. Comput. , vol.9 , Issue.4 , pp. 846-855
- Baker, B.S.¹ Coffman, E.G.² Rivest, R.S.³

4
- 0027558279
- Packings in two dimensions: Asymptotic average case analysis of algorithms
- (1993) Algorithmica , vol.9 , pp. 253-277
- Coffman, E.G.¹ Shor, P.W.²

5
- 0002528075
- Approximation algorithms for bin packing: An updated survey
- G. Ausiello, M. Lucertini, P. Serafini (Eds.), Springer, New York
- (1984) Algorithm Design for Computer System Design , pp. 49-106
- Coffman, E.G.¹ Garey, M.R.² Johnson, D.S.³

6
- 0001899512
- From approximate to optimal solutions: A case study of number partitioning
- Montreal, Canada
- (1995) Proceedings of the 14th IJCAI , pp. 266-272
- Korf, R.¹

7
- 0022772130
- Probabilistic analysis of optimum partitioning
- (1986) J. Appl. Probab. , vol.23 , pp. 626-645
- Karmarker, G.S.L.N.K.¹ Karp, R.M.² Odlyzko, A.M.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.