We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we assume that failures only affect unsafe edges. In Unweighted Flexible Graph Connectivity we are given an undirected graph $G = (V,E)$ in which the edge set $E$ is partitioned into a set $S$ of safe edges and a set $U$ of unsafe edges and the task is to find a set $T$ of at most $k$ edges such that $T - \{u\}$ is connected and spans $V$ for any unsafe edge $u \in T$. Unweighted Flexible Graph Connectivity generalizes both Spanning Tree and Hamiltonian Cycle. We study Unweighted Flexible Graph Connectivity in terms of fixed-parameter tractability (FPT). We show an almost complete dichotomy on which parameters lead to fixed-parameter tractability and which lead to hardness. To this end, we obtain FPT-time algorithms with respect to the vertex deletion distance to cluster graphs and with respect to the treewidth. By exploiting the close relationship to Hamiltonian Cycle, we show that FPT-time algorithms for many smaller parameters are unlikely under standard parameterized complexity assumptions. Regarding problem-specific parameters, we observe that Unweighted Flexible Graph Connectivity} admits an FPT-time algorithm when parameterized by the number of unsafe edges. Furthermore, we investigate a below-upper-bound parameter for the number of edges of a solution. We show that this parameter also leads to an FPT-time algorithm.

翻译：我们研究了经典生成树问题在非均匀故障模型下的推广形式。具体而言，边被分为**安全边**或**不安全边**两类，且假设故障仅影响不安全边。在无权灵活图连通性问题中，给定一个无向图$G = (V,E)$，其中边集$E$被划分为安全边集合$S$与不安全边集合$U$，任务是寻找一个至多包含$k$条边的子集$T$，使得对于任意不安全边$u \in T$，$T - \{u\}$仍保持连通且覆盖所有顶点$V$。无权灵活图连通性同时推广了生成树问题和哈密顿环问题。我们从固定参数可解性（FPT）角度研究了该问题，并建立了一个近乎完整的二分法：哪些参数可导致固定参数可解性，哪些导致计算困难性。为此，我们分别针对到聚类图的顶点删除距离和树宽参数设计了FPT时间算法。通过揭示其与哈密顿环问题的密切关联，我们证明在标准参数化复杂性假设下，针对许多更小参数的FPT时间算法几乎不可能存在。在问题特定参数方面，我们发现以不安全边数量为参数时，无权灵活图连通性存在FPT时间算法。此外，我们探究了解中边数的上界之下参数，并证明该参数同样可导出FPT时间算法。