Compact floor-planning via orderly spanning trees

Journal of Algorithms

Volumn 48, Issue 2, 2003, Pages 441-451

  Liao, Chien Chih ^a   Lu, Hsueh I ^b   Yen, Hsu Chun ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING; VLSI CIRCUITS;

FLOOR-PLANNING;

TREES (MATHEMATICS);

EID: 0041928206     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00057-9     Document Type: Article

References (23)

1. J. Bhasker, S. Sahni, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks 17 (1987) 307-317.
2. J. Bhasker, S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988) 247-278.
3. N. Bonichon, B. Le Saëc, M. Mosbah, Orthogonal drawings based on the stratification of planar graphs, Technical Report RR-1246-00, Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2000, presented at the 6th International Conference on Graph Theory, Marseille, France, August 28-September 1, 2000.
4. Y.-T. Chiang, C.-C. Lin, H.-I Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, USA, 7-9 January, 2001, pp. 506-515.
5. R.C.-N. Chuang, A. Garg, X. He, M.-Y. Kao, H.-I Lu, Compact encodings of planar graphs via canonical ordering and multiple parentheses, in: K.G. Larsen, S. Skyum, G. Winskel (Eds.), Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, Aalborg, Denmark, in: Lecture Notes in Comput. Sci., Vol. 1443, Springer-Verlag, 1998, pp. 118-129.
6. H. de Fraysseix, P. Ossona de Mendez, P. Rosenstiehl, On triangle contact graphs, Combin. Probab. Comput. 3 (1994) 233-246.
7. H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990) 41-51.
8. U. Fößmeier, G. Kant, M. Kaufmann, 2-visibility drawings of planar graphs, in: S. North (Ed.), Proceedings of the 4th International Symposium on Graph Drawing, CA, USA, in: Lecture Notes in Comput. Sci., Vol. 1190, Springer-Verlag, 1996, pp. 155-168.
9. X. He, On finding the rectangular duals of planar triangular graphs, SIAM J. Comput. 22 (1993) 1218-1226.
10. X. He, On floor-plan of plane graphs, SIAM J. Comput. 28 (6) (1999) 2150-2167.
11. G. Jacobson, Space-efficient static trees and graphs, in: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, 30 October-1 November, IEEE, 1989, pp. 549-554.
12. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica 16 (1) (1996) 4-32.
13. G. Kant, X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci. 172 (1-2) (1997) 175-193.
14. K. Kózmiński, E. Kinnen, Rectangular duals of planar graphs, Networks 15 (2) (1985) 145-157.
15. K.A. Kózmiński, E. Kinnen, Rectangular dualization and rectangular dissections, IEEE Trans. Circuits Systems 35 (11) (1988) 1401-1416.
16. Y.T. Lai, S.M. Leinwand, A theory of rectangular dual graphs, Algorithmica 5 (4) (1990) 467-483.
17. K. Mailing, S.H. Mueller, W.R. Heller, On finding most optimal rectangular package plans, in: Proceedings of the 19th Annual IEEE Design Automation Conference, 1982, pp. 263-270.
18. J.I. Munro, V. Raman, Succinct representation of balanced parentheses, static trees and planar graphs, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20-22 October, IEEE, 1997, pp. 118-126.
19. W. Schnyder, Planar graphs and poset dimension, Order 5 (1989) 323-343.
20. W. Schnyder, Embedding planar graphs on the grid, in: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138-148.
21. Y. Sun, M. Sarrafzadeh, Floor-planning by graph dualization: L-shaped modules, Algorithmica 10 (6) (1993) 429-456.
22. S. Tsukiyama, K. Koike, I. Shirakawa, An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floorplan, in: Proceedings of the IEEE International Symposium on Circuits and Systems, 1986, pp. 321-324.
23. K.-H. Yeap, M. Sarrafzadeh, Floor-planning by graph dualization: 2-concave rectilinear modules, SIAM J. Comput. 22 (3) (1993) 500-526.