arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.1595math.COcs.CGcs.DM
收藏

次闭图类中的分层分离子及其应用

Layered Separators in Minor-Closed Graph Classes with Applications

Vida Dujmović, Pat Morin, David R. Wood

摘要:

图分隔符是图论和计算机科学中普遍存在的工具。然而,在某些应用中,它们的有用性受到以下事实的限制:在具有$n$顶点的图中,分隔符可以与$Ω(\sqrt{n})$一样大。这是可平面图的情况,更一般地,对于适当的小闭类。我们研究了一种特殊类型的图分隔符,称为“分层分隔符”,它可以在$n$中具有线性大小,但相对于不同的措施,称为“宽度”有界的大小。例如,我们证明了可平面图和有界欧拉亏格的图允许有界宽度的分层分离子。更一般地说,我们将承认有界宽度的分层分隔符的未成年人封闭类,排除固定顶点图作为未成年人。我们使用分层分离器来证明$\mathcal{O}(\log n)$边界的一些问题,其中$\mathcal{O}(\sqrt{n})$是一个长期存在的以前的最佳界限。这包括有界Euler亏格图的非重复色数和非重复色数。我们推广了这些结果与$\mathcal{O}(\log n)$界的非重复色数的图不包括一个固定的拓扑子,和$\log^{ \mathcal{O}(1)}n$界的不包括一个固定的子图的重复数。只有可平面图的$\log^{ \mathcal{O}(1)}n$边界以前是已知的。我们的结果意味着,每个$n$ -顶点图不包括一个固定的子有一个三维网格绘图与$n\log^{ \mathcal{O}(1)}n$体积,而以前的最佳界是$\mathcal{O}(n^{3/2})$。

英文摘要:

Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as $Ω(\sqrt{n})$ in graphs with $n$ vertices. This is the case for planar graphs, and more generally, for proper minor-closed classes. We study a special type of graph separator, called a "layered separator", which may have linear size in $n$, but has bounded size with respect to a different measure, called the "width". We prove, for example, that planar graphs and graphs of bounded Euler genus admit layered separators of bounded width. More generally, we characterise the minor-closed classes that admit layered separators of bounded width as those that exclude a fixed apex graph as a minor. We use layered separators to prove $\mathcal{O}(\log n)$ bounds for a number of problems where $\mathcal{O}(\sqrt{n})$ was a long-standing previous best bound. This includes the nonrepetitive chromatic number and queue-number of graphs with bounded Euler genus. We extend these results with a $\mathcal{O}(\log n)$ bound on the nonrepetitive chromatic number of graphs excluding a fixed topological minor, and a $\log^{ \mathcal{O}(1)}n$ bound on the queue-number of graphs excluding a fixed minor. Only for planar graphs were $\log^{ \mathcal{O}(1)}n$ bounds previously known. Our results imply that every $n$-vertex graph excluding a fixed minor has a 3-dimensional grid drawing with $n\log^{ \mathcal{O}(1)}n$ volume, whereas the previous best bound was $\mathcal{O}(n^{3/2})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑