Disconnected graph layout and the polyomino packing approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2265 LNCS, Issue , 2002, Pages 378-391

  Freivalds, Karlis ^a   Dogrusoz, Ugur ^b   Kikusts, Paulis ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DRAWING (GRAPHICS);

DISCONNECTED GRAPH; NEW APPROACHES; POLYOMINOES;

DRAWING (GRAPHICS); ALGORITHMS;

EID: 84867444225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_30     Document Type: Conference Paper

References (12)

1. B. S. Baker, E. G. Coffman, and R. S. Rivest. Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4):846-855, November 1980.
2. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: An updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pages 49-106. Springer-Verlag, New York, 1984.
3. E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4):808-826, November 1990.
4. E. G. Coffman and P. W. Shor. Packings in two dimensions: Asymptotic averagecase analysis of algorithms. Algorithmica, 9:253-277, 1993.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235-282, 1994.
6. U. Dogrusoz. Algorithms for layout of disconnected graphs. Information Sciences, to appear.
7. U. Dogrusoz, M. Doorley, Q. Feng, A. Frick, B. Madden, and G. Sander. Toolkits for development of software diagramming applications. IEEE Computer Graphics and Applications, to appear.
8. U. Dogrusoz and G. Sander. Graph visualization. ACM Computing Surveys, to appear.
9. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
10. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
11. P. Kikusts and P. Rucevskis. Layout algorithms of graph-like diagrams of GRADE windows graphic editors. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 361-364. Springer-Verlag, 1995.
12. T. Lengauer. Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, 1990.