# Distance-d independent set problems for bipartite and chordal graphs

Hiroshi Eto, Fengrui Guo, Eiji Miyano

13 被引用数 (Scopus)

## 抄録

The paper studies a generalization of the Independent Set problem (IS for short). A distance- d independent set for an integer d≥2 in an unweighted graph G = (V, E) is a subset S⊂ V of vertices such that for any pair of vertices u, v εS, the distance between u and v is at least d in G. Given an unweighted graph G and a positive integer k, the Distance- d Independent Set problem (D d IS for short) is to decide whether G contains a distance- d independent set S such that |S| ≥k. D2IS is identical to the original IS. Thus D2IS is \mathcal{NP} -complete even for planar graphs, but it is in \mathcal{P} for bipartite graphs and chordal graphs. In this paper we investigate the computational complexity of D d IS, its maximization version MaxD d IS, and its parameterized version ParaD d IS(k), where the parameter is the size of the distance- d independent set: (1) We first prove that for any ε >0 and any fixed integer d≥3, it is \mathcal{NP} -hard to approximate MaxD d IS to within a factor of n1/2- for bipartite graphs of n vertices, and for any fixed integer d≥3, ParaD d IS(k) is \mathcal{W} -hard for bipartite graphs. Then, (2) we prove that for every fixed integer d≥3, D d IS remains NP -complete even for planar bipartite graphs of maximum degree three. Furthermore, (3) we show that if the input graph is restricted to chordal graphs, then D d IS can be solved in polynomial time for any even d≥2, whereas D d IS is NP -complete for any odd d≥3. Also, we show the hardness of approximation of MaxD d IS and the W -hardness of ParaD d IS(k) on chordal graphs for any odd d≥3.

本文言語 英語 88-99 12 Journal of Combinatorial Optimization 27 1 https://doi.org/10.1007/s10878-012-9594-4 出版済み - 1 2014 はい

## All Science Journal Classification (ASJC) codes

• コンピュータ サイエンスの応用
• 離散数学と組合せ数学
• 制御と最適化
• 計算理論と計算数学
• 応用数学

## フィンガープリント

「Distance-d independent set problems for bipartite and chordal graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。