On linear layouts of graphs

Discrete Mathematics and Theoretical Computer Science

Volumn 6, Issue 2, 2004, Pages 339-358

  Dujmović, Vida ^a,b   Wood, David R ^b,c  

^a MCGILL UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Arch layout; Book embedding; Book thickness; Graph drawing; Graph layout; Page number; Queue layout; Queue number; Stack layout; Stack number

Indexed keywords

EID: 20544431537     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (111)

1. A. A. AGEEV, A triangle-free circle graph with chromatic number 5. Discrete Math., 152(1-3):295-298, 1996.
2. M. ALZOHAIRI AND I. RIVAL, Series-parallel planar ordered sets have pagenumber two. In S. NORTH, ed., Proc. 4th International Symp. on Graph Drawing (GD '96), vol. 1190 of Lecture Notes in Comput. Sci., pp. 11-24, Springer, 1997.
3. M. ALZOHAIRI, I. RIVAL, AND A. KOSTOCHKA, The pagenumber of spherical lattices is unbounded. Arab J. Math. Sci., 7(1):79-82, 2001.
4. F. R. BERNHART AND P. C. KAINEN, The book thickness of a graph. J. Combin. Theory Ser. B, 27(3):320-331, 1979.
5. S. N. BHATT, F. R. K. CHUNG, F. T. LEIGHTON, AND A. L. ROSENBERG, Scheduling tree-dags using FIFO queues: A control-memory trade-off. J. Parallel Distrib. Comput., 33:55-68, 1996.
6. T. C. BIEDL, T. SHERMER, S. WHITESIDES, AND S. WISMATH, Bounds for orthogonal 3-D graph drawing. J. Graph Algorithms Appl., 3(4):63-79, 1999.
7. T. BILSKI, Embedding graphs in books with prespecified order of vertices. Studia Automat., 18:5-12, 1993.
8. T. BILSKI, Optimum embedding of complete graphs in books. Discrete Math., 182(1-3):21-28, 1998.
9. R. BLANKENSHIP, Book Embeddings of Graphs. Ph.D. thesis, Department of Mathematics, Louisiana State University, U.S.A., 2003.
10. R. BLANKENSHIP AND B. OPOROWSKI, Drawing subdivisions of complete and complete bipartite graphs on books. Tech. Rep. 1999-4, Department of Mathematics, Louisiana State University, 1999.
11. R. BLANKENSHIP AND B. OPOROWSKI, Book embeddings of graphs and minor-closed classes. In Proc. 32nd Southeastern International Conf. on Combinatorics, Graph Theory and Computing, Department of Mathematics, Louisiana State University, 2001.
12. H. BODLAENDER, ed., Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science (WG'03), vol. 2880 of Lecture Notes in Comput Sci., Springer, 2003.
13. P. BOSE, J. CZYZOWICZ, P. MORIN, AND D. R. WOOD, The maximum number of edges in a three-dimensional grid-drawing. In Proc. 19th European Workshop on Computational Geometry, pp. 101-103, University of Bonn, Germany, 2003.
14. J. BUSS AND P. SHOR, On the pagenumber of planar graphs. In Proc. 16th ACM Symp. on Theory of Computing (STOC '84), pp. 98-100, ACM, 1984.
15. J. F. BUSS, A. L. ROSENBERG, AND J. D. KNOTT, Vertex types in book-embeddings. SIAM J. Discrete Math., 2(2):156-175, 1989.
16. Y.-C. CHEN, H.-L. FU, AND I.-F. SUN, A study of typenumber in book-embedding. Ars Combin., 62:97-103, 2002.
17. F. R. K. CHUNG, F. T. LEIGHTON, AND A. L. ROSENBERG, Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Methods, 8(1):33-58, 1987.
18. G. A. COTTAFAVA AND O. D'ANTONA, Book-thickness and book-coarseness of graphs. In Proc. 5th International Symp. on Network Theory (Sarajevo), pp. 337-340, 1984.
19. D. P. DAILEY, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math., 30:289-293, 1980.
20. E. DAMIANI, O. D'ANTONA, AND P. SALEMI, An upper bound to the crossing number of the complete graph drawn on the pages of a book. J. Combin. Inform. System Sci., 19(1-2): 75-84, 1994.
21. H. DE FRAYSSEIX, P. OSSONA DE MENDEZ, AND J. PACH, A left-first search algorithm for planar graphs. Discrete Comput. Geom., 13(3-4):459-468, 1995.
22. A. M. DEAN AND J. P. HUTCHINSON, Relations among embedding parameters for graphs. In Graph theory, combinatorics, and applications, Vol. 1, pp. 287-296, Wiley, 1991.
23. E. DI GIACOMO, W. DIDIMO, G. LIOTTA, AND S. WISMATH, Book embeddings and point-set embeddings of series-parallel digraphs. In M. T. GOODRICH AND S. G. KOBOUROV, eds., Proc. 10th International Symp. on Graph Drawing (GD '02), vol. 2528 of Lecture Notes in Comput. Sci., pp. 162-173, Springer, 2002.
24. E. DI GIACOMO, W. DIDIMO, G. LIOTTA, AND S. K. WISMATH, Drawing planar graphs on a curve. In [12], pp. 192-204.
25. E. DI GIACOMO AND H. MEIJER, Track drawings of graphs with constant queue number. In G. LIOTTA, ed., Proc. 11th International Symp. on Graph Drawing (GD '03), vol. 2912 of Lecture Notes in Comput. Sci., pp. 214-225, Springer, 2004.
26. R. P. DILWORTH, A decomposition theorem for partially ordered sets. Ann. of Math. (2), 51:161-166, 1950.
27. V. DUJMOVIĆ, P. MORIN, AND D. R. WOOD, Layout of graphs with bounded tree-width, 2002, submitted.
28. V. DUJMOVIĆ AND D. R. WOOD, Tree-partitions of k-trees with applications in graph layout. Tech. Rep. TR-2002-03, School of Computer Science, Carleton University, Ottawa, Canada, 2002.
29. V. DUJMOVIĆ AND D. R. WOOD, Stacks, queues and tracks: Layouts of graph subdivisions, 2003, submitted. See Tech. Rep. TR-2003-08, School of Computer Science, Carleton University, Ottawa, Canada, 2003.
30. V. DUJMOVIĆ AND D. R. WOOD, Track layouts of graphs, 2003, submitted. See Tech. Rep. TR-2003-07, School of Computer Science, Carleton University, Ottawa, Canada, 2003.
31. V. DUJMOVIĆ AND D. R. WOOD, Tree-partitions of k-trees with applications in graph layout. In [12], pp. 205-217.
32. B. DUSHNIK AND E. W. MILLER, Partially ordered sets. Amer. J. Math., 63:600-610, 1941.
33. T. ENDO, The pagenumber of toroidal graphs is at most seven. Discrete Math., 175(1-3):87-96, 1997.
34. H. ENOMOTO, T. NAKAMIGAWA, AND K. OTA, On the pagenumber of complete bipartite graphs. J. Combin. Theory Ser. B, 71(1):111-120, 1997.
35. D. EPPSTEIN, Separating geometric thickness from book thickness. arXiv.org:math.CO/0109195, 2001.
36. S. EVEN AND A. ITAI, Queues, stacks, and graphs. In Z. KOHAVI AND A. PAZ, eds., Proc. International Symp. on Theory of Machines and Computations, pp. 71-86, Academic Press, 1971.
37. H.-L. FU AND I.-F. SUN, The typenumber of trees. Discrete Math., 253(1-3):3-10, 2002.
38. Z. GALIL, R. KANNAN, AND E. SZEMERÉDI, On 3-pushdown graphs with large separators. Combinatorica, 9(1):9-19, 1989.
39. Z. GALIL, R. KANNAN, AND E. SZEMERÉDI, On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines. J. Comput. System Sci., 38(1):134-149, 1989.
40. R. A. GAMES, Optimal book embeddings of the FFT, Benes, and barrel shifter networks. Algorithmica, 1(2):233-250, 1986.
41. J. L. GANLEY, Stack and queue layouts of Halin graphs, 1995, manuscript.
42. J. L. GANLEY AND L. S. HEATH, The pagenumber of k-trees is O(k). Discrete Appl. Math., 109(3):215-221, 2001.
43. M. R. GAREY, D. S. JOHNSON, G. L. MILLER, AND C. H. PAPADIMITRIOU, The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods, 1(2):216-227, 1980.
44. M. R. GAREY, D. S. JOHNSON, AND L. STOCKMEYER, Some simplified NP-complete graph problems. Theoret. Comput. Sci., 1:237-267, 1976.
45. C. GAVOILLE AND N. HANUSSE, Compact routing tables for graphs of bounded genus. In J. WIEDERMANN, P. VAN EMDE BOAS, AND M. NIELSEN, eds., Proc. 26th International Colloquium on Automata, Languages and Programming (ICALP '99), vol. 1644 of Lecture Notes in Computer Science, pp. 351-360, Springer, 1999.
46. A. GYÁRFÁS, On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math., 55(2):161-166, 1985.
47. A. GYÁRFÁS, Corrigendum: "On the chromatic number of multiple interval graphs and overlap graphs". Discrete Math., 62(3):333, 1986.
48. A. GYÁRFÁS AND J. LEHEL, Covering and coloring problems for relatives of intervals. Discrete Math., 55(2):167-180, 1985.
49. T. HARJU AND L. ILIE, Forbidden subsequences and permutations sortable on two parallel stacks. In Where mathematics, computer science, linguistics and biology meet, pp. 267-275, Kluwer, 2001.
50. T. HASUNUMA, Embedding iterated line digraphs in books. Networks, 40(2):51-62, 2002.
51. T. HASUNUMA AND Y. SHIBATA, Embedding de Bruijn, Kautz and shuffle-exchange networks in books. Discrete Appl. Math., 78(1-3):103-116, 1997.
52. L. S. HEATH, Embedding planar graphs in seven pages. In Proc. 25th Annual Symp. on Foundations of Comput. Sci. (FOCS '84), pp. 74-83, IEEE, 1984.
53. L. S. HEATH, Embedding outerplanar graphs in small books. SIAM J. Algebraic Discrete Methods, 8(2):198-218, 1987.
54. L. S. HEATH AND S. ISTRAIL, The pagenumber of genus g graphs is O(g). J. Assoc. Comput. Mach., 39(3):479-501, 1992.
55. L. S. HEATH, F. T. LEIGHTON, AND A. L. ROSENBERG, Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math., 5(3):398-412, 1992.
56. L. S. HEATH AND S. V. PEMMARAJU, Stack and queue layouts of posets. SIAM J. Discrete Math., 10(4):599-625, 1997.
57. L. S. HEATH AND S. V. PEMMARAJU, Stack and queue layouts of directed acyclic graphs. II. SIAM J. Comput., 28(5):1588-1626, 1999.
58. L. S. HEATH, S. V. PEMMARAJU, AND A. N. TRENK, Stack and queue layouts of directed acyclic graphs. I. SIAM J. Comput., 28(4):1510-1539, 1999.
59. L. S. HEATH AND A. L. ROSENBERG, Laying out graphs using queues. SIAM J. Comput., 21(5):927-958, 1992.
60. R. A. HOCHBERG AND M. F. STALLMANN, Optimal one-page tree embeddings in linear time. Inform. Process. Lett., 87:59-66, 2003.
61. A. IMAMIYA AND A. NOZAKI, Generating and sorting permutations using restricted-deques. Information Processing in Japan, 17:80-86, 1977.
62. M. ISHIWATA, Book presentation of the complete n-partite graphs. Kobe J. Math., 13(1):27-48, 1996.
63. G. JACOBSON, Space-efficient static trees and graphs. In Proc. 30th Annual Symp. Foundations of Comput. Sci. (FOCS '89), pp. 549-554, IEEE, 1989.
64. P. C. KAINEN, The book thickness of a graph. II. In Proc. 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing, vol. 71 of Congr. Numer., pp. 127-132, 1990.
65. P. C. KAINEN AND S. OVERBAY, Book embeddings of graphs and a theorem of Whitney. Submitted.
66. R. KANNAN, Unraveling k-page graphs. Inform. and Control, 66(1-2):1-5, 1985.
67. N. KAPOOR, M. RUSSELL, I. STOJMENOVIC, AND A. Y. ZOMAYA, A genetic algorithm for finding the pagenumber of interconnection networks. J. Parallel Distrib. Comput., 62(2):267-283, 2002.
68. R. M. KARP, Reducibility among combinatorial problems. In R. E. MILLER AND J. W. THATCHER, eds., Complexity of Computer Communications, pp. 85-103, Plenum Press, 1972.
69. C. D. KEYS, Graphs critical for maximal bookthickness. Pi Mu Epsilon J., 6:79-84, 1975.
70. K. KOBAYASHI, Book presentation and local unknottedness of spatial graphs. Kobe J. Math., 10(2):161-171, 1993.
71. A. KOSTOCHKA AND J. KRATOCHVÍL, Covering and coloring polygon-circle graphs. Discrete Math., 163(1-3):299-305, 1997.
72. A. V. KOSTOCHKA, Upper bounds on the chromatic number of graphs. Trudy Inst. Mat., 10:204-226, 1988.
73. Q. H. LE TU, A planar poset which requires four pages. Ars Combin., 35:291-302, 1993.
74. Y. LIN, Cutwidth and related parameters of graphs. J. Zhengzhou Univ. Nat. Sci. Ed., 34(1):1-5, 2002.
75. S. M. MALITZ, Genus g graphs have pagenumber O(√g). J. Algorithms, 17(1):85-109, 1994.
76. S. M. MALITZ, Graphs with E edges have pagenumber O(√E). J. Algorithms, 17(1):71-84, 1994.
77. S. MASUYAMA AND S. NAITO, Deciding whether graph G has page number one is in NC. Inform. Process. Lett., 44(1):7-10, 1992.
78. S. L. MITCHELL, Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Process. Lett., 9(5):229-232, 1979.
79. S. MORAN AND Y. WOLFSTAHL, One-page book embedding under vertex-neighborhood constraints. SIAM J. Discrete Math., 3(3):376-390, 1990.
80. S. MORAN AND Y. WOLFSTHAL, Two-page book embedding of trees under vertex-neighborhood constraints. Discrete Appl. Math., 43(3):233-241, 1993.
81. D. J. MUDER, M. L. WEAVER, AND D. B. WEST, Pagenumber of complete bipartite graphs. J. Graph Theory, 12(4):469-489, 1988.
82. J. I. MUNRO AND V. RAMAN, Succinct representation of balanced parentheses and static trees. SIAM J. Comput., 31(3):762-776, 2001.
83. R. NOWAKOWSKI AND A. PARKER, Ordered sets, pagenumbers and planarity. Order, 6(3):209-218, 1989.
84. B. OBRENIĆ, Embedding de Bruijn and shuffle-exchange graphs in five pages. SIAM J. Discrete Math., 6(4):642-654, 1993.
85. L. T. OLLMANN, On the book thicknesses of various graphs. In F. HOFFMAN, R. B. LEVOW, AND R. S. D. THOMAS, eds., Proc. 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, vol. VIII of Congressus Numerantium, p. 459, 1973.
86. E. T. ORDMAN AND W. SCHMITT, Permutations using stacks and queues. In Proc. of 24th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, vol. 96 of Congr. Numer., pp. 57-64, 1993.
87. S. OVERBAY, Generalized Book Embeddings. Ph.D. thesis, Colorado State University, U.S.A., 1998.
88. S. V. PEMMARAJU, Exploring the Powers of Stacks and Queues via Graph Layouts. Ph.D. thesis, Virginia Polytechnic Institute and State University, U.S.A., 1992.
89. V. R. PRATT, Computing permutations with double-ended queues. Parallel stacks and parallel queues. In Proc. 5th Annual ACM Symp. on Theory of Computing (STOC '73), pp. 268-277, ACM, 1973.
90. H. J. PRÖMEL, T. SCHICKINGER, AND A. STEGER, A note on triangle-free and bipartite graphs. Discrete Math., 257(2-3):531-540, 2002.
91. S. RENGARAJAN AND C. E. VENI MADHAVAN, Stack and queue number of 2-trees. In D. DINGZHU AND L. MING, eds., Proc. 1st Annual International Conf. on Computing and Combinatorics (COCOON '95), vol. 959 of Lecture Notes in Comput. Sci., pp. 203-212, Springer, 1995.
92. A. L. ROSENBERG, The DIOGENES approach to testable fault-tolerant arrays of processors. IEEE Trans. Comput., C-32:902-910, 1983.
93. A. L. ROSENBERG, Book embeddings and wafer-scale integration. In Proc. 17th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, vol. 54 of Congr. Numer., pp. 217-224, 1986.
94. A. L. ROSENBERG, DIOGENES, circa 1986. In Proc. VLSI Algorithms and Architectures, vol. 227 of Lecture Notes in Comput. Sci., pp. 96-107, Springer, 1986.
95. F. SHAHROKHI AND W. SHI, On crossing sets, disjoint sets, and pagenumber. J. Algorithms, 34(1):40-53, 2000.
96. F. SHAHROKHI, L. A. SZÉKELY, O. SÝKORA, AND I. VRŤO, The book crossing number of a graph. J. Graph Theory, 21(4):413-424, 1996.
97. E. STÖHR, A trade-off between page number and page width of book embeddings of graphs. Inform. and Comput., 79(2):155-162, 1988.
98. n- cylinders. J. Information Processing and Cybernetics EIK, 26, 1990.
99. E. STÖHR, The pagewidth of trivalent planar graphs. Discrete Math., 89(1):43-49, 1991.
100. R. P. SWAMINATHAN, D. GIRIRAJ, AND D. K. BHATIA, The pagenumber of the class of bandwidth-k graphs is k - 1. Inform. Process. Lett., 55(2):71-74, 1995.
101. M. M. SYSŁO, Bounds to the page number of partially ordered sets. In M. NAGL, ed., Proc. 15th International Workshop in Graph-Theoretic Concepts in Computer Science (WG '89), vol. 411 of Lecture Notes in Comput. Sci., pp. 181-195, Springer, 1990.
102. R. TARJAN, Sorting using networks of queues and stacks. J. Assoc. Comput. Mach., 19:341-346, 1972.
103. M. TOGASAKI AND K. YAMAZAKI, Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs. Discrete Math., 259(1-3):361-368, 2002.
104. W. UNGER, On the k-colouring of circle-graphs. In M. W. R. CORI, ed., Proc. 5th International Symp. on Theoretical Aspects of Computer Science (STACS '88), vol. 294 of Lecture Notes in Comput. Sci., pp. 61-72, Springer, 1988.
105. W. UNGER, The complexity of colouring circle graphs. In A. FINKEL AND M. JANTZEN, eds., Proc. 9th International Symp. on Theoretical Aspects of Computer Science (STACS '92), vol. 577 of Lecture Notes in Comput. Sci., pp. 389-400, Springer, 1992.
106. M. J. WANG, Some results on embedding grid graphs in books. J. Zhengzhou Univ. Nat. Sci. Ed., 29(2):31-34, 1997.
107. A. WIGDERSON, The complexity of the Hamiltonian circuit problem for maximal planar graphs. Tech. Rep. EECS 198, Princeton University, U.S.A., 1982.
108. D. R. WOOD, Bounded degree book embeddings and three-dimensional orthogonal graph drawing. In P. MUTZEL, M. JÜNGER, AND S. LEIPERT, eds., Proc. 9th International Symp. on Graph Drawing (GD '01), vol. 2265 of Lecture Notes in Comput. Sci., pp. 312-327, Springer, 2002.
109. D. R. WOOD, Degree constrained book embeddings. J. Algorithms, 45(2):144-154, 2002.
110. D. R. WOOD, Queue layouts, tree-width, and three-dimensional graph drawing. In M. AGRAWAL AND A. SETH, eds., Proc. 22nd Foundations of Software Technology and Theoretical Computer Science (FST TCS '02), vol. 2556 of Lecture Notes in Comput. Sci., pp. 348-359, Springer, 2002.
111. M. YANNAKAKIS, Embedding planar graphs in four pages. J. Comput. System Sci., 38:36-67, 1986.