A monotone drawing of a graph G is a straight line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of graphs have been discovered as a new standard for visualizing graphs. In this paper we study monotone drawings of series-parallel graphs in a variable embedding setting. We show that a series-parallel graph of n vertices has a straight-line planar monotone drawing on a grid of size O(n)×O(n 2). © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hossain, M. I., & Rahman, M. S. (2013). Straight-line monotone grid drawings of series-parallel graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7936 LNCS, pp. 672–679). https://doi.org/10.1007/978-3-642-38768-5_59
Mendeley helps you to discover research relevant for your work.