Straight-Line Monotone Grid Drawings of Series-Parallel Graphs

  • Md. Iqbal Hossain
  • Md. Saidur Rahman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)

Abstract

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(nO(n2).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. Journal of Graph Algorithms and Applications 16(1), 5–35 (2012)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone drawings of graphs with fixed embedding. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 379–390. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Arkin, E.M., Connelly, R., Mitchell, J.S.: On monotone paths among obstacles with applications to planning assemblies. In: Proceedings of the Fifth Annual Symposium on Computational Geometry, SCG 1989, pp. 334–343. ACM, New York (1989)CrossRefGoogle Scholar
  4. 4.
    Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science 61(2-3), 175–198 (1988)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with spqr-trees. Algorithmica 15(4), 302–318 (1996)MATHMathSciNetGoogle Scholar
  6. 6.
    Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica 23, 302–340 (1999)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of series-parallel graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 409–420. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Samee, M.A.H., Rahman, M.S.: Upward planar drawings of series-parallel digraphs with maximum degree three. In: WALCOM 2007, pp. 28–45 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Md. Iqbal Hossain
    • 1
  • Md. Saidur Rahman
    • 1
  1. 1.Graph Drawing and Information Visualization Laboratory, Department of Computer Science and EngineeringBangladesh University of Engineering and TechnologyBangladesh

Personalised recommendations