Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian tree product number. We review many results in the literature showing these parameters are tied to treewidth. In a number of cases we also improve known bounds, provide simpler proofs and show that the inequalities presented are tight.
受计算拓扑学中固定参数易处理(FPT)问题的启发,我们考虑由\[ \operatorname{tw}(M) = \min\{\operatorname{tw}(Γ(\mathcal{T})):\mathcal{T}~\text{is a triangulation of }M\}, \]定义的紧致连通3-流形$M$的树宽,其中$Γ(\mathcal{T})$表示$\mathcal{T}$的对偶图.在这种情况下,3-流形的拓扑与其树宽之间的关系特别有趣。首先,作为Jaco和Rubinstein工作的推论,我们证明了对于任何闭的、可定向的3-流形$M$,树宽$\operatorname{tw}(M)$至多是$4\mathfrak{g}(M)-2$,其中$\mathfrak{g}(M)$表示$M$的Heegaard亏格。结合我们早期的工作与瓦格纳,这产生的非哈肯流形的Heegaard亏格和树宽是在一个常数的因素。其次,我们刻画了树宽为1的所有3-流形:这些流形恰好是透镜空间和另一个塞弗特纤维空间。进一步证明了2-球面或非可定向曲面上的可定向Seifert纤维空间的树宽均为2。特别地,对于每一个球面3-流形,我们展示了树宽至多为2的三角剖分。我们的研究结果进一步验证了参数的树宽(和其他相关参数,如cutwidth,或拥塞)是有用的拓扑计算,也揭示了更多的光在该领域现有的FPT算法的范围。
Parameterized complexity of isometric path partition: treewidth and diameter
School of Computer Science, University of Leeds(利兹大学计算机学院);Aix-Marseille Université, CNRS, LIS(艾克斯-马赛大学,法国国家科学研究中心,实验室信息系统);LIRMM, Université de Montpellier, CNRS(蒙彼利埃大学,法国国家科学研究中心,信息科学与媒体实验室);Indian Institute of Science Education and Research Pune(印度科学教育与研究学院普纳分校)
The role of planarity in connectivity problems parameterized by treewidth
For some years it was believed that for "connectivity" problems such as Hamiltonian Cycle, algorithms running in time 2^{O(tw)}n^{O(1)} -called single-exponential- existed only on planar and other sparse graph classes, where tw stands for the treewidth of the n-vertex input graph. This was recently disproved by Cygan et al. [FOCS 2011], Bodlaender et al. [ICALP 2013], and Fomin et al. [SODA 2014], who provided single-exponential algorithms on general graphs for essentially all connectivity problems that were known to be solvable in single-exponential time on sparse graphs. In this article we f…
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学物理学院);Institute of Mathematics, Physics and Mechanics(数学、物理与力学研究所);TU Wien(维也纳工业大学);Faculty of Computer and Information Science, University of Ljubljana(卢布尔雅那大学计算机与信息科学学院);Department of Mathematics and Computer Science, TU Eindhoven(埃因霍温理工大学数学与计算机科学系);Theoretical Computer Science, Osnabrück University(奥斯纳布吕克大学理论计算机科学)
On giant components and treewidth in the layers model
给定一个无向$n$ -顶点图$G(V,E)$和一个整数$k$,令$T_k(G)$表示$G$的随机顶点导出子图,该子图是通过根据随机置换$π$对$V$进行排序并在$T_k(G)$中包含至多$k-1$的邻居按此顺序在它们之前的那些顶点而生成的.以这种方式采样的子图的分布称为\emph{layers model with parameter} $k$。层模型在$\ell$ -退化子图的研究、最大独立集问题的算法设计以及自举渗流等方面都有应用。在目前的工作中,我们扩展的层模型的结构特性的研究。我们证明了存在$3$ -正则图$G$,其中$T_3(G)$有一个连通分支的大小为$Ω(n)$。此外,该连通分支具有树宽$Ω(n)$。树宽的这个下限可以扩展到许多其他随机图模型。相比之下,$T_2(G)$是一个森林(因此树宽为1),我们建立,如果$G$是有界的程度,那么在$T_2(G)$的最大连通分量的大小$O(\log n)$的概率很高。我们还考虑了无限的二维网格,我们证明了第一个四层包含一个唯一的无限连通组件概率$1$。