Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science

Volumn 172, Issue 1-2, 1997, Pages 175-193

  Kant, Goos ^a   He, Xin ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GEOMETRY; GRAPH THEORY; PROBLEM SOLVING;

CANONICAL ORDERING; LINEAR TIME ALGORITHMS; PLANE GRAPHS; RECTANGULAR DUAL; REGULAR EDGE LABELING; VISIBILITY REPRESENTATION;

ALGORITHMS;

EID: 0031069913     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(95)00257-X     Document Type: Article

References (20)

1. J. Bhasker and 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. Bhaskar and S. Sahni, A linear algorithm to find a rectanular dual of a planar triangulated graph, Algorithmica 3 (1988) 247-278.
3. N. Chiba and N. Takao, Arbority and subgraph listing algorithms, SIAM J. Comput. 14 (1985) 210-223.
4. G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. Theory Appl. 4 (1994) 235-282.
5. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990) 41-51.
6. T. Hagerup, M. Chrobak and K. Diks. Optimal parallel 5-coloring of planar graphs, SIAM J. Comput. 18 (2) (1989) 288-300.
7. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput. 22 (1993) 1218-1226.
8. X. He, An efficient parallel algorithm for finding rectangular dual duals of planar triangular graphs, Algorithmica 13 (6) (1995) 553-572.
9. X. He, Grid embedding of 4-connected plane graphs, in: Proc. Graph Drawing (GD'95), Lecture Notes in Comp. Science, Vol. 1027 (1995) 287-299.
10. W.R. Heller, G. Sorkin and K. Mailing, The planar package planner for system designers, in: Proc. 19th Ann. IEEE Design Automation Conf., New York (1982) 253-260.
11. J. Hopcroft and R.E. Tarjan, Efficient planarity testing, J. ACM 21 (4) (1974) 549-568.
12. G. Kant, Drawing planar graphs using the lmc-ordering, in Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh (1992) 101-110.
13. G. Kant, A more compact visibility representation, in: Proc. 19th Intern. Workshop on Graph-Theoretic Concepts in Comp. Science (WG'93), Lecture Notes in Comp. Science, Vol. 790 (Springer, Berlin, 1993) 411-424.
14. K. Koźmiński and E. Kinnen, Rectangular dual of planar graphs, Networks 15 (1985) 145-157.
15. Y.-T. Lai and S.M. Leinwand, A theory of rectangular dual graphs, Algorithmica 5 (1990) 467-483.
16. K. Mailing, S.H. Meuller and W.R. Heller, On finding most optimal rectangular package plans. Proc. 19th Ann. IEEE Design Automation Conf., New York (1982) 263-270.
17. P. Rosenstiehl and R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comp. Geometry 1 (1986) 343-353.
18. W. Schnyder, Planar graphs and poset dimension, Orders 5 (1989) 323-343.
19. W. Schnyder, Embedding planar graphs on the grid, in: Proc. 1st Ann. ACM-SIAM Symp. on Discr. Alg., San Francisco (1990) 138-147.
20. R. Tamassia and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comp. Geometry 1 (1986) 321-341.