No-bend orthogonal drawings of series-parallel graphs

Authors:
Md. Saidur Rahman;Noritsugu Egi;Takao Nishizeki
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh;Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 5
Cited 4

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
On-Line Planarity Testing

SIAM Journal on Computing
Spirality and Optimal Orthogonal Drawings

SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing

SIAM Journal on Computing
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three

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

Discrete Applied Mathematics
Complexity of finding non-planar rectilinear drawings of graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
On rectilinear drawing of graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. Every series-parallel graph is planar. In this paper we give a linear-time algorithm to examine whether a series-parallel graph G of the maximum degree three has a no-bend orthogonal drawing and to find one if G has.