Inner rectangular drawings of plane graphs

International Journal of Computational Geometry and Applications

Volumn 16, Issue 2-3, 2006, Pages 249-270

  Miura, Kazuyuki ^a   Haga, Hiroki ^b   Nishizeki, Takao ^b  

^a FUKUSHIMA UNIVERSITY   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithm; Graph drawing; Inner rectangular drawing; Rectangular drawing

Indexed keywords

EID: 33646512840     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195906002026     Document Type: Conference Paper

References (27)

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, New Jersey, 1993).
2. J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988) 247-278.
3. G. Di Battista, P. Eades, R. Tamassia and G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs (Prentice Hall, NJ, 1999).
4. S. Even and R. E. Tarjan, Network flow and testing graph connectivity, SIAM J. Comput. 4 (1975) 507-518.
5. T. Feder and R. Motowani, Clique partitions, graph compression and speeding-up algorithms, in Proc. 23rd Ann. ACM Symp. Theory of Computing, 1991, pp. 123-133.
6. R. L. Francis and J. A. White, Facility Layout and Location (Prentice Hall, New Jersey, 1974).
7. A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, in Proc. Graph Drawing '96, Lecture Notes in Computer Science, Springer, 1190, 1997, pp. 201-206.
8. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput. 22(6) (1993) 1218-1226.
9. D. S. Hochbaum, Faster pseudoflow-based algorithms for the bipartite matching and the closure problems, in Abstract, CORS/SCRO-INFORMS Joint Int. Meeting, Banff, Canada, May 16-19, 2004, p. 46.
10. D. S. Hochbaum and B. G. Chandran, Further below the flow decomposition barrier of maximum flow for bipartite matching and maximum closure, Working paper, 2004.
11. 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973) 225-231.
12. G. Kant and X. He, Regular edge-labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci. 172 (1997) 175-193.
13. K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, Proc. 21st DAC, Albuquerque, 1984, pp. 655-656.
14. Y.-T. Lai and S. M. Leinwand, A theory of rectangular dual graphs, Algorithmica 5 (1990) 467-483.
15. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout (Wiley, Chichester, 1990).
16. G. L. Miller and J. S. Naor, Flows in planar graphs with multiple sources and sinks, SIAM J. Comput. 24(5) (1995) 1002-1017.
17. S. Micali and V. V. Vazirani, An O(√|V|·|E|) algorithm for finding maximum matching in general graphs, Proc. 21st Ann. Symp. Foundations of Computer Science, 1980, pp. 17-27.
18. K. Miura, A. Miyazawa and T. Nishizeki, Extended rectangular drawing of plane graphs with designated corners, Proc. Graph Drawing '02, Lecture Notes in Computer Science, Springer, 2528, 2002, pp. 256-267.
19. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optinization (Prentice Hall, Englewood Cliffs, NJ, 1982).
20. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Comput. Geom. 21 (2002) 121-138.
21. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Comp. Geom. Theo. Appl. 10(3) (1998) 203-220.
22. S. M. Sait and H. Youssef, VLSI Physical Design Automation (World Scientific, Singapore, 1999).
23. Y. Sun and M. Sarrafzadeh, Floorplanning by graph dualization: L-shape modules, Algorithmica 10 (1993) 429-456.
24. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16(3) (1987) 421-444.
25. C. Thomassen, Plane representations of graphs, Progress in Graph Theory, eds. J. A. Bondy and U. S. R. Murty (Academic Press Canada, Don Mills, Ontario, Canada, 1984), pp. 43-69.
26. W. T. Tutte, A short proof of the factor theorem for finite graphs, Canad. J. Math. 6 (1954) 347-352.
27. K. Yeap and M. Sarrafzadeh, Floor-planning by graph dualization: 2-concave rectilinear modules, SIAM J. Comput. 22(3) (1993) 500-526.