Minimizing the area for planar straight-line grid drawings

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

Volumn 4875 LNCS, Issue , 2008, Pages 207-212

  Krug, Marcus ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED SIZE; EXPERIMENTAL STUDIES; GRAPH DRAWING; GRID DRAWINGS; INTERNATIONAL SYMPOSIUM; ITERATIVE APPROACHES; NP-COMPLETE; PLANAR GRAPHS; STRAIGHT-LINE DRAWINGS;

DRAWING (GRAPHICS); GRAPH THEORY; NUCLEAR PROPULSION;

PHOTOCOPYING;

EID: 49949117182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77537-9_21     Document Type: Conference Paper

References (6)

1. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41-51 (1990)
2. Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990. Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, pp. 138-148 (1990)
3. Zhang, H., He, X.: Canonical ordering tree and its applications in graph drawing (2003)
4. Kramer, M., van Leeuwen, J.: The NP-completeness of finding minimum area layouts for VLSI-circuits (to appear). Technical Report RUU-CS-82-06, Institute of Information and Computing Sciences, Utrecht University (1982)
5. Krug, M.: Minimizing the area for planar straight-line grid drawings. Master's thesis, Universität Karlsruhe (2007)
6. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)