Layouts of Graph Subdivisions

  • Vida Dujmović
  • David R. Wood
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)

Abstract

A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of a vertex k-colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The stack-number (respectively, queue-number, track-number) of a graph G, denoted by sn(G) (qn(G), tn(G)) is the minimum k such that G has a k-stack (k-queue, k-track) layout. This paper studies stack, queue, and track layouts of graph subdivisions. It is known that every graph has a 3-stack subdivision. The best known upper bound on the number of division vertices per edge in a 3-stack subdivision of an n-vertex graph G is improved from \(\mathcal{O}({\rm log} n) to \mathcal{O}({\rm log min}\{sn(G), qn(G)\})\). This result reduces the question of whether queue-number is bounded by stack-number to whether 3-stack graphs have bounded queue number. It is proved that every graph has a 2-queue subdivision, a 4-track subdivision, and a mixed 1-stack 1-queue subdivision. All these values are optimal for every non-planar graph. In addition, we characterise those graphs with k-stack, k-queue, and k-track subdivisions, for all values of k. The number of division vertices per edge in the case of 2-queue and 4-track subdivisions, namely \(\mathcal{O}({\rm log}{\sf qn}(G))\), is optimal to within a constant factor, for every graph G. Applications to 3D polyline grid drawings are presented. For example, it is proved that every graph G has a 3D polyline grid drawing with the vertices on a rectangular prism, and with \(\mathcal{O}({\rm log}{\sf qn}(G))\).

References

  1. 1.
    Blankenship, R., Oporowski, B.: Drawing subdivisions of complete and complete bipartite graphs on books. Technical Report 1999-4, Department of Mathematics, Louisiana State University (1999)Google Scholar
  2. 2.
    Bose, P., Czyzowicz, J., Morin, P., Wood, D.R.: The maximum number of edges in a three-dimensional grid-drawing. J. Graph Algorithms Appl. 8(1), 21–26 (2004)MATHMathSciNetGoogle Scholar
  3. 3.
    Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Threedimensional graph drawing. Algorithmica 17(2), 199–208 (1996)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Di Giacomo, E., Meijer, H.: Track drawings of graphs with constant queue number. In: Liotta [16], pp. 214–225Google Scholar
  5. 5.
    Dujmović, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. (to appear)Google Scholar
  6. 6.
    Dujmović, V., Pór, A., Wood, D.R.: Track layouts of graphs. Submitted; see arXiv:cs.DM/0407033 (2004)Google Scholar
  7. 7.
    Dujmović, V., Wood, D.R.: Stacks, queues and tracks: Layouts of graph subdivisions. Submitted; see Tech. Rep. TR-2003-08, School of Computer Science, Carleton University, Ottawa, Canada (2003)Google Scholar
  8. 8.
    Dujmović, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 339–358 (2004)MATHMathSciNetGoogle Scholar
  9. 9.
    Dujmović, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach [18], pp. 55–66Google Scholar
  10. 10.
    Enomoto, H., Miyauchi, M.S.: Embedding graphs into a three page book with O(M logN) crossings of edges over the spine. SIAM J. Discrete Math. 12(3), 337–341 (1999)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Enomoto, H., Miyauchi, M.S.: Embedding a graph into a d + 1-page book with ⌈m log d n⌉ edge-crossings over the spine. IPSJ SIGNotes ALgorithms, 051, Abstract No. 008 (2001)Google Scholar
  12. 12.
    Enomoto, H., Miyauchi, M.S., Ota, K.: Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. Discrete Appl. Math. 92(2-3), 149–155 (1999)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Eppstein, D.: Separating thickness from geometric thickness. In: Pach [18], pp. 75–86Google Scholar
  14. 14.
    Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 363–398 (2003)MATHMathSciNetGoogle Scholar
  15. 15.
    Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398–412 (1992)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Liotta, G. (ed.): GD 2003. LNCS, vol. 2912. Springer, Heidelberg (2004)MATHGoogle Scholar
  17. 17.
    Miyauchi, M.S.: An O(nm) algorithm for embedding graphs into a 3-page book. Trans. IEICE E77-A(3), pp. 521–526 (1994)Google Scholar
  18. 18.
    Pach, J. (ed.): Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342. Amer. Math. Soc. (2004)Google Scholar
  19. 19.
    Pach, J., Thiele, T., Tóth, G.: Three-dimensional grid drawings of graphs. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in discrete and computational geometry. Contemporary Mathematics, vol. 223, pp. 251–255. Amer. Math. Soc. (1999) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Vida Dujmović
    • 1
    • 2
  • David R. Wood
    • 2
    • 3
  1. 1.School of Computer ScienceMcGill UniversityMontréalCanada
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
  3. 3.Department of Applied MathematicsCharles UniversityPragueCzech Republic

Personalised recommendations