On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs
スポンサーリンク
概要
- 論文の詳細を見る
It has been known that every planar 4-graph has a 2-bend 2-D orthogonal drawing with the only exception of octahedron, every planar 3-graph has a 1-bend 2-D orthogonal drawing with the only exception of K_4, and every outerplanar 3-graph with no triangles has a 0-bend 2-D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2-D orthogonal drawing.
- 社団法人電子情報通信学会の論文
- 2005-11-03
著者
-
Tayu Satoshi
Dept. Communications And Integrated Systems Tokyo Inst. Tech
-
Nomura Kumiko
Dept. Communications And Integrated Systems Tokyo Inst. Tech
-
UENO Suichi
Dept. Communications and Integrated Systems, Tokyo Inst. Tech
-
Ueno Suichi
Dept. Communications And Integrated Systems Tokyo Inst. Tech
-
Ueno Shuichi
Dept. Of Communications & Integrated Syst. Tokyo Inst. Of Tech.
-
Ueno Shuichi
Dept. Communications and Integrated Systems, Tokyo Inst. Tech
関連論文
- A-1-28 A Note on a Problem of Nano-PLA Design
- A-1-8 Characterizations of Two-Directional Orthogonal Ray Graphs
- A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems(Algorithms and Data Structures)
- On the Three-Dimensional Orthogonal Drawing of Series-Parallel Graphs
- On the Orthogonal Drawing of Outerplanar Graphs(Graphs and Networks)
- A-1-31 A Note on Sparse Networks Tolerating Random Faults for Cycles(A-1. 回路とシステム, 基礎・境界)
- On the Orthogonal Drawing of Series-Parallel Graphs
- A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System(Graphs and Networks)
- On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs
- On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs
- A-1-7 Universal Test Sets for Reversible Circuits
- A-1-35 Minimum Feedback Vertex Sets in Permutation Bigraphs