Stack and Queue Layouts via Layered Separators

It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors. For fixed g and k, we show that every n-vertex graph that can be embedded on a surface of genus g with at most k crossings per edge has stack-number \(\mathcal {O}(\log n)\); this includes k-planar graphs. The previously best known bound for the stack-number of these families was \(\mathcal {O}(\sqrt{n})\), except in the case of 1-planar graphs. Analogous results are proved for map graphs that can be embedded on a surface of fixed genus. None of these families is closed under taking minors. The main ingredient in the proof of these results is a construction proving that n-vertex graphs that admit constant layered separators have \(\mathcal {O}(\log n)\) stack-number.

[1]  David Eppstein,et al.  Track Layouts, Layered Path Decompositions, and Leveled Planarity , 2018, Algorithmica.

[2]  Mihalis Yannakais,et al.  Embedding planar graphs in four pages , 1989, STOC 1989.

[3]  David Eppstein,et al.  Genus, Treewidth, and Local Crossing Number , 2015, GD.

[4]  Zhi-Zhong Chen.  New bounds on the edge number of a k-map graph , 2007 .

[5]  Stephen G. Kobourov,et al.  On the Book Thickness of 1-Planar Graphs , 2015, ArXiv.

[6]  Seth M. Malitz,et al.  Genus g Graphs Have Pagenumber O(sqrt(g)) , 1994, J. Algorithms.

[7]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[8]  Vida Dujmovic.  Graph layouts via layered separators , 2015, J. Comb. Theory, Ser. B.

[9]  David R. Wood,et al.  Nonrepetitive Colourings of Planar Graphs with O(log n) Colours , 2012, Electron. J. Comb..

[10]  Seth M. Malitz,et al.  Graphs with E Edges Have Pagenumber O(sqrt(E)) , 1994, J. Algorithms.

[11]  János Pach,et al.  Graphs drawn with few crossings per edge , 1997, Comb..

[12]  János Pach,et al.  On the Queue Number of Planar Graphs , 2013, SIAM J. Comput..

[13]  Erik D. Demaine,et al.  Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.

[14]  Pat Morin,et al.  Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[15]  Fedor V. Fomin,et al.  Bidimensionality and geometric graphs , 2011, SODA.

[16]  Pat Morin,et al.  Layered Separators in Minor-Closed Families with Applications , 2013 .

[17]  David R. Wood,et al.  On Linear Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..

[18]  R. Blankenship.  Book embeddings of graphs , 2003 .

[19]  Zhi-Zhong Chen,et al.  Map graphs , 1999, JACM.

[20]  Michael A. Bekos,et al.  1-Planar Graphs have Constant Book Thickness , 2015, ESA.

[21]  Pat Morin,et al.  Layout of Graphs with Bounded Tree-Width , 2004, SIAM J. Comput..

[22]  Zhi-Zhong Chen,et al.  Approximation Algorithms for Independent Sets in Map Graphs , 2000, J. Algorithms.