暂无分享,去创建一个
[1] Michael A. Bekos,et al. Four Pages Are Indeed Necessary for Planar Graphs , 2020, J. Comput. Geom..
[2] Pat Morin,et al. Planar Graphs have Bounded Queue-Number , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[3] Michael A. Bekos,et al. Planar graphs of bounded degree have bounded queue number , 2019, STOC.
[4] Michael A. Bekos,et al. Queue Layouts of Planar 3-Trees , 2018, Algorithmica.
[5] Vida Dujmovic,et al. Stack and Queue Layouts via Layered Separators , 2016, GD.
[6] Veit Wiechert,et al. On the Queue-Number of Graphs with Bounded Tree-Width , 2016, Electron. J. Comb..
[7] William E. Devanny,et al. Track Layouts, Layered Path Decompositions, and Leveled Planarity , 2015, Algorithmica.
[8] Jan Kratochvíl,et al. A note on planar partial 3-trees , 2012, ArXiv.
[9] János Pach,et al. On the Queue Number of Planar Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[10] David R. Wood,et al. Track Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..
[11] Pat Morin,et al. Layout of Graphs with Bounded Tree-Width , 2004, SIAM J. Comput..
[12] David R. Wood,et al. Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing , 2002, FSTTCS.
[13] JOSEP DÍAZ,et al. A survey of graph layout problems , 2002, CSUR.
[14] R. Gary Parker,et al. On minimum cuts and the linear arrangement problem , 2000, Discret. Appl. Math..
[15] Lenwood S. Heath,et al. Laying out Graphs Using Queues , 1992, SIAM J. Comput..
[16] Arnold L. Rosenberg,et al. Comparing Queues and Stacks as Mechanisms for Laying out Graphs , 1992, SIAM J. Discret. Math..
[17] Mihalis Yannakais,et al. Embedding planar graphs in four pages , 1989, STOC 1989.
[18] Lenwood S. Heath. Embedding Planar Graphs in Seven Pages , 1984, FOCS.
[19] Norman E. Gibbs,et al. The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.
[20] Paul C. Kainen,et al. The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.
[21] David R. Wood,et al. On Linear Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..
[22] Îáá Íâåçîá Þ Ü Ý ¸ Èì Åçêáae Ü Ý,et al. Layout of Graphs with Bounded Tree-Width , 2004 .
[23] André Raspaud,et al. On Bandwidth, Cutwidth, and Quotient Graphs , 1995, RAIRO Theor. Informatics Appl..