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

结构化连接增强

Structured Connectivity Augmentation

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos

摘要:

我们开始的算法研究以下的“结构化增强”的问题:是否有可能增加一个给定的图G的连接,通过叠加它与另一个给定的图H?更精确地说,图F是G和H关于内射映射V(H)->V(G)的叠加,如果F的每条边uv是G的一条边,或者是H的一条边,则F是G和H关于内射映射V(H)->V(G)的叠加。我们考虑以下优化问题。给定图G,H,以及一个赋予V(G)的顶点对非负权的权函数ω,我们的任务是找到最小权值ω(x)= \sum_{xy\in E(H)} ω(x)φ(y))的φ,使得G和H关于x的叠加F的边连通度高于G的边连通度.我们的主要结果是下面的“二分法”复杂性分类。我们称一类图C的点覆盖数有界,如果存在一个只依赖于C的常数t,使得C中的每个图的点覆盖数不超过t.本文证明了对每一类顶点覆盖数有界的图C,当H \in C.另一方面,对于任意顶点覆盖数无界的遗传类C,当H \in C.对于结构化增强问题的未加权变体,即任务是确定是否存在所需连通性的图的叠加的问题,我们提供了存在这种叠加的必要和充分组合条件。这些条件意味着多项式时间算法解决未加权的问题的变种。

英文摘要:

We initiate the algorithmic study of the following "structured augmentation" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition of G and H with respect to injective mapping ϕ: V(H)->V(G) if every edge uv of F is either an edge of G, or ϕ^{-1}(u)ϕ^{-1}(v) is an edge of H. We consider the following optimization problem. Given graphs G,H, and a weight function ωassigning non-negative weights to pairs of vertices of V(G), the task is to find φof minimum weight ω(ϕ)=\sum_{xy\in E(H)}ω(ϕ(x)φ(y)) such that the edge connectivity of the superposition F of G and H with respect to ϕis higher than the edge connectivity of G. Our main result is the following "dichotomy" complexity classification. We say that a class of graphs C has bounded vertex-cover number, if there is a constant t depending on C only such that the vertex-cover number of every graph from C does not exceed t. We show that for every class of graphs C with bounded vertex-cover number, the problems of superposing into a connected graph F and to 2-edge connected graph F, are solvable in polynomial time when H\in C. On the other hand, for any hereditary class C with unbounded vertex-cover number, both problems are NP-hard when H\in C. For the unweighted variants of structured augmentation problems, i.e. the problems where the task is to identify whether there is a superposition of graphs of required connectivity, we provide necessary and sufficient combinatorial conditions on the existence of such superpositions. These conditions imply polynomial time algorithms solving the unweighted variants of the problems.

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

↑