An Application of Well-Orderly Trees in Graph Drawing

Well-orderly trees seem to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n–1)/5, by using well-orderly trees.

[1]  Xin He,et al.  Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs , 2003, WADS.

[2]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[3]  Hsueh-I Lu,et al.  Some Applications of Orderly Spanning Trees in Graph Drawing , 2002, Graph Drawing.

[4]  Goos Kant,et al.  Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..

[5]  Xin He,et al.  New Theoretical Bounds of Visibility Representation of Plane Graphs , 2004, GD.

[6]  Nicolas Bonichon,et al.  An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation , 2003, STACS.

[7]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[8]  M. Chrobak,et al.  Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[9]  Goos Kant,et al.  A More Compact Visibility Representation , 1997, Int. J. Comput. Geom. Appl..

[10]  Hsueh-I Lu,et al.  Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer , 2002, SIAM J. Discret. Math..

[11]  Hsueh-I Lu,et al.  Compact floor-planning via orderly spanning trees , 2003, J. Algorithms.

[12]  Nicolas Bonichon,et al.  Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation , 2003, WG.

[13]  Goos Kant,et al.  2-Visibility Drawings of Planar Graphs , 1996, GD.

[14]  Hsueh-I Lu,et al.  Floor-Planning via Orderly Spanning Trees , 2001, Graph Drawing.

[15]  Goos Kant,et al.  Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

[16]  Yi-Ting Chiang,et al.  Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[17]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[18]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[19]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[20]  Nicolas Bonichon,et al.  Wagner's Theorem on Realizers , 2002, ICALP.

[21]  Xin He,et al.  On Visibility Representation of Plane Graphs , 2004, STACS.

[22]  Goos Kant,et al.  Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[23]  G. Kant.  Algorithms for drawing planar graphs , 1993 .

[24]  Huaming Zhang,et al.  Canonical Ordering Trees and Their Applications in Graph Drawing , 2005, Discret. Comput. Geom..

[25]  Xin He,et al.  Improved visibility representation of plane graphs , 2005, Comput. Geom..