Canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs

International Journal of Foundations of Computer Science

Volumn 16, Issue 1, 2005, Pages 117-141

  Miura, Kazuyuki ^a   Azuma, Machiko ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646190776     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105002905     Document Type: Conference Paper

References (24)

1. H. L. Chen, C. C. Liao, H. I. Lu and H. C. Yen, Some applications of orderly spanning trees in graph drawing, Proc. Graph Drawing 2002 (GD 2002), LNCS 2528, pp. 332-343 (2002).
2. Y. T. Chiang, C. C. Lin and H. I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 506-515 (2001).
3. N. Chiba, K. Onoguchi and T. Nishizeki, Drawing planar graphs nicely, Acta Inform., 22, pp. 187-201 (1985).
4. N. Chiba, T. Yamanouchi and T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in Progress in Graph Theory, J. A. Bondy and U. S. R. Murty (Eds.), Academic Press, pp. 153-173 (1984).
5. M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, International Journal of Computational Geometry and Applications, 7, pp. 211-223 (1997).
6. M. Chrobak and S. Nakano, Minimum-width grid drawings of plane graphs, Computational Geometry: Theory and Applications, 10, pp. 29-54 (1998).
7. M. Chrobak and T. Payne, A linear-time algorithm for drawing planar graphs on a grid, Information Processing Letters, 54, pp. 241-246 (1995).
8. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10, pp. 41-51 (1990).
9. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing, Prentice Hall, NJ (1999).
10. G. Di Battista, R. Tamassia and L. Vismara, Output-sensitive reporting of disjoint paths, Algorithmica, 4, pp. 302-340 (1999).
11. I. Fáry, On straight lines representation of plane graphs, Acta Sci. Math. Szeged, 11, pp. 229-233 (1948).
12. S. Felsner, Convex drawings of planar graphs and the order dimension of S-polytopes, Order, 18, pp. 19-37 (2001).
13. X. He, Grid embedding of 4-connected plane graphs, Discrete & Computational Geometry, 17, pp. 339-358 (1997).
14. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Compt., 2, 3, pp. 135-138 (1973).
15. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16, pp. 4-32 (1996).
16. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, 172, pp. 175-193 (1997).
17. C. C. Liao, H. I. Lu and H. C. Yen, Compact floor-planning via orderly spanning trees, Journal of Algorithms, 48, 2, pp. 441-451 (2003).
18. K. Miura, M. Azuma and T. Nishizeki, Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs, Proc. of 10th Annual International Conference COCOON 2004, LNCS 3106, pp. 309-318 (2004).
19. K. Miura, S. Nakano and T. Nishizeki, Convex grid drawings of four-connected plane graphs, Proc. of 11th International Conference ISAAC 2000, LNCS 1969, pp. 254-265 (2000).
20. S. Nakano, Planar drawings of plane graphs! $Special Issue on Algorithm Engineering! $ IEICE Trans. Inf. ! u Syst., E83-D ! $3 ! $3pp. 384-391 (2000).
21. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam (1988).
22. W. Schnyder, Embedding planar graphs on the grid, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, pp. 138-147 (1990).
23. C. Thomassen, Plane representations of graphs, J. A. Bondy, U. S. R. Murty (Eds.), Progress in Graph Theory, Academic Press Canada, Don Mills, Ontario, Canada, pp. 43-69 (1984).
24. W. T. Tutte, How to draw a graph, Proc. London Math. Soc., 13, pp. 743-768 (1963).