arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.3700cs.CC
收藏

k-biclique的参数化复杂性

The Parameterized Complexity of k-Biclique

Bingkai Lin

摘要:

给定一个图$G$和一个参数$k$,$k$ -biclique问题询问$G$是否包含一个完全二部子图$K_{k,k}$。这是图中最容易陈述的问题,其参数化的复杂性仍然未知。我们提供了一个FPT约简从$k$ -团到$k$ -biclique,从而解决了这个长期存在的开放问题。我们的减少使用一类二分图的阈值属性的独立利益。更具体地说,对于正整数$n$,$s$和$t$,我们考虑一个二分图$G=(A\;\dot\cup\;B, E)$,使得$A$可以被划分为$A=V_1\;\dot\cup \;V_2\;\dot\cup\cdots\dot\cup\; V_n$,并且对于每个$s$不同的索引$i_1\cdots i_s$,存在$v_{i_1}\in V_{i_1}\cdots v_{i_s}\in V_{i_s}$,使得$v_{i_1}\cdots v_{i_s}$在$B$中至少有$t+1$公共邻居;另一方面,$A$中的每个$s+1$不同的顶点在$B$中至多有$t$公共邻居。利用Paley型图和Weil的特征和定理,证明了当$t=(s+1)!$和$n$足够大时,这种阈值二部图可以在$n^{O(1)}$中计算.我们的约简的一个推论是,没有$f(k)\cdot n^{o(k)}$时间算法来决定一个图是否包含与$K_{k!,k!}$同构的子图,除非ETH(指数时间假设)失败。我们还提供了一个概率构造更好的参数$t=Θ(s^2)$,这表明$k$ -biclique没有$f(k)\cdot n^{o(\sqrt{k})}$ -时间算法,除非3-SAT与$m$子句可以解决在$2^{o(m)}$ -时间与高概率。我们的结果也暗示了基数约束满足问题的参数化复杂性和最大PDMATHAMN-交问题的不可逼近性的二分法分类。

英文摘要:

Given a graph $G$ and a parameter $k$, the $k$-biclique problem asks whether $G$ contains a complete bipartite subgraph $K_{k,k}$. This is the most easily stated problem on graphs whose parameterized complexity is still unknown. We provide an fpt-reduction from $k$-clique to $k$-biclique, thus solving this longstanding open problem. Our reduction use a class of bipartite graphs with a threshold property of independent interest. More specifically, for positive integers $n$, $s$ and $t$, we consider a bipartite graph $G=(A\;\dot\cup\;B, E)$ such that $A$ can be partitioned into $A=V_1\;\dot\cup \;V_2\;\dot\cup\cdots\dot\cup\; V_n$ and for every $s$ distinct indices $i_1\cdots i_s$, there exist $v_{i_1}\in V_{i_1}\cdots v_{i_s}\in V_{i_s}$ such that $v_{i_1}\cdots v_{i_s}$ have at least $t+1$ common neighbors in $B$; on the other hand, every $s+1$ distinct vertices in $A$ have at most $t$ common neighbors in $B$. Using the Paley-type graphs and Weil's character sum theorem, we show that for $t=(s+1)!$ and $n$ large enough, such threshold bipartite graphs can be computed in $n^{O(1)}$. One corollary of our reduction is that there is no $f(k)\cdot n^{o(k)}$ time algorithm to decide whether a graph contains a subgraph isomorphic to $K_{k!,k!}$ unless the ETH(Exponential Time Hypothesis) fails. We also provide a probabilistic construction with better parameters $t=Θ(s^2)$, which indicates that $k$-biclique has no $f(k)\cdot n^{o(\sqrt{k})}$-time algorithm unless 3-SAT with $m$ clauses can be solved in $2^{o(m)}$-time with high probability. Our result also implies the dichotomy classification of the parameterized complexity of cardinality constrain satisfaction problem and the inapproximability of maximum $k$-intersection problem.

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

↑