论文信息 - On the two-dimensional orthogonal drawing of series-parallel graphs

On the two-dimensional orthogonal drawing of series-parallel graphs

It has been known that every planar 4-graph has a 2-bend 2D orthogonal drawing with the only exception of octahedron, every planar 3-graph has a 1-bend 2D orthogonal drawing with the only exception of K 4, and every outerplanar 3-graph with no triangles has a 0-bend 2D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2D orthogonal drawing

Kumiko Nomura | Satoshi Tayu | Shuichi Ueno

[1] Yanpei Liu,et al. A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid , 1998, Discret. Appl. Math..

[2] Giuseppe Liotta,et al. Spirality and Optimal Orthogonal Drawings , 1998, SIAM J. Comput..

[3] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[4] Ted H. Szymanski,et al. Embeddings of Star Graphs into Optical Meshes without Bends , 1997, J. Parallel Distributed Comput..

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

[6] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[7] Roberto Tamassia,et al. On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[8] Md. Saidur Rahman,et al. No-bend Orthogonal Drawings of Series-Parallel Graphs , 2005, Graph Drawing.

[9] Takao Nishizeki,et al. Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends , 2008, SIAM J. Discret. Math..

[10] Goos Kant,et al. A better heuristic for orthogonal graph drawings , 1998, Comput. Geom..

[11] Kumiko Nomura,et al. On the Orthogonal Drawing of Outerplanar Graphs , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..