arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.04575cs.DM
收藏

在非均匀故障模型下寻找稀疏连通生成子图

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model

Matthias Bentert, Jannik Schestag, Frank Sommer

AI总结:

本文研究非均匀故障模型下的无权灵活图连通性问题,通过参数化复杂性分析给出几乎完全的FPT二分性结果,并为树宽、到簇图距离、不安全边数及低于上界参数等设计FPT算法。

摘要:

我们研究经典生成树问题的一种推广,该推广允许非均匀故障模型。更准确地说,边要么是安全的,要么是不安全的,我们假设故障只影响不安全的边。在无权灵活图连通性问题中,给定一个无向图 $G = (V,E)$,其中边集 $E$ 被划分为安全边集合 $S$ 和不安全边集合 $U$,任务是找到一个至多包含 $k$ 条边的集合 $T$,使得对于任意不安全边 $u \in T$,$T - \{u\}$ 都是连通的并且生成 $V$。无权灵活图连通性同时推广了生成树和哈密顿回路。我们从固定参数可解性(FPT)的角度研究无权灵活图连通性。我们给出了一个几乎完全的二分法,说明哪些参数导致固定参数可解性,哪些导致难解性。为此,我们获得了关于到簇图的顶点删除距离和关于树宽的 FPT 时间算法。通过利用与哈密顿回路的紧密关系,我们证明在标准参数化复杂性假设下,许多更小参数的 FPT 时间算法不太可能存在。关于问题特定参数,我们观察到无权灵活图连通性在以不安全边数量为参数时存在 FPT 时间算法。此外,我们研究了关于解的边数的低于上界参数。我们证明该参数也能导出 FPT 时间算法。

英文摘要:

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.

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

↑