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

诱导$k$ -独立图的团问题

The clique problem on inductive $k$-independent graphs

George Manoussakis

摘要:

一个图是归纳$k$ -独立的,如果存在它的顶点$v_{1},...,v_{n}$且其排序使得$α(G[N(v_{i})\cap V_{i}])\leq k $,其中$N(v_{i})$是$v_{i}$的邻域,$V_{i}=\{v_{i},...,v_{n}\}$和$α$是独立数.在这篇文章中,通过回答[Y.Ye,A.Borodin,Elimination graphs,ACM Trans. Algorithms 8(2)(2012)14:1-14:23]的问题,我们设计了一个多项式时间近似算法,其中最大团具有比率{ $\overlineΔ \slash log(log(\overline{ Δ}) \slash k)$},并且还表明该问题的决策版本对于具有复杂度$O(1.2127^{(p+k-1)^{k}}n)$的这个特定图形族是固定参数可处理的。然后我们研究了归纳$k$ -独立图的一个子类,即$k$ -退化图.一个图是$k$ -退化的,如果存在它的顶点$v_{1},...,v_{n}$的序使得$|N(v_{i})\cap V_{i}|\leq k $ .我们的贡献是一个算法计算这类图的最大团的时间$O(1.2127^{k}(n-k+1))$,从而提高以前的最佳结果。我们还证明了一些结构性质的归纳$k$独立图。

英文摘要:

A graph is inductive $k$-independent if there exists and ordering of its vertices $v_{1},...,v_{n}$ such that $α(G[N(v_{i})\cap V_{i}])\leq k $ where $N(v_{i})$ is the neighborhood of $v_{i}$, $V_{i}=\{v_{i},...,v_{n}\}$ and $α$ is the independence number. In this article, by answering to a question of [Y.Ye, A.Borodin, Elimination graphs, ACM Trans. Algorithms 8 (2) (2012) 14:1-14:23], we design a polynomial time approximation algorithm with ratio {$\overlineΔ \slash log(log(\overline{ Δ}) \slash k)$ for the maximum clique and also show that the decision version of this problem is fixed parameter tractable for this particular family of graphs with complexity $O(1.2127^{(p+k-1)^{k}}n)$. Then we study a subclass of inductive $k$-independent graphs, namely $k$-degenerate graphs. A graph is $k$-degenerate if there exists an ordering of its vertices $v_{1},...,v_{n}$ such that $|N(v_{i})\cap V_{i}|\leq k $. Our contribution is an algorithm computing a maximum clique for this class of graphs in time $O(1.2127^{k}(n-k+1))$, thus improving previous best results. We also prove some structural properties for inductive $k$-independent graphs.

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

↑