Octagonal drawings of plane graphs with prescribed face areas

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

Volumn 3353, Issue , 2004, Pages 320-331

  Rahman, Md Saidur ^a   Miura, Kazuyuki ^b   Nishizeki, Takao ^b  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; TREES (MATHEMATICS); CLUSTERING ALGORITHMS; GRAPH THEORY;

A-PLANE; CONDITION; FACE AREA; HORIZONTAL SLICES; LINEAR-TIME ALGORITHMS; ORTHOGONAL DRAWINGS; PLANE GRAPHS; SLICING PATH; TREE STRUCTURES; VLSI FLOORPLANNING;

CLUSTERING ALGORITHMS; TREES (MATHEMATICS);

EID: 35048900541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_27     Document Type: Article

References (10)

1. X. He, On floorplans of planar graphs, SIAM Journal on Computing, 28(6), pp. 2150-2167, 1999.
2. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.
3. M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bend-optimal orthogonal drawings of Unconnected cubic plane graphs, Journal of Graph. Alg. and Appl., http://jgaa.info, 3(4), pp. 31-62, 1999.
4. W. Shi, A fast algorithm for area minimization of slicing floorplans, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(12), pp. 1525-1532, 1996.
5. Y. Sun and M. Sarrafzadeh, Floorplanning by graph dualization: L-shaped modules, Algorithmica, 10, pp. 429-456, 1998.
6. S. M. Sait and H. Youssef, VLSI Physical Design Automation, World Scientific, Singapore, 1999.
7. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16, pp. 421-444, 1987.
8. C. Thomassen, Plane cubic graphs with prescribed face areas, Combinatorics, Probability and Computing, 1, pp. 371-381, 1992.
9. K. Yeap and M. Sarrafzadeh, Floor-planning by graph dualization: 2-concave rectilinear modules, SIAM J. Comput., 22(3), pp. 500-526, 1993.
10. K. H. Yeap and M. Sarrafzadeh, Sliceable floorplanning by graph dualization, SIAM J. Disc. Math., 8(2), pp. 258-280, 1995.