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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Rahman, M. S., Egi, N., & Nishizeki, T. (2006). No-bend orthogonal drawings of series-parallel graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3843 LNCS, pp. 409–420). Springer Verlag. https://doi.org/10.1007/11618058_37
Mendeley helps you to discover research relevant for your work.