Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Irit Dinur,Subhash Khot,Will Perkins,Muli Safra

Foundations of Computer Science（2010）

引用 14|浏览2

暂无评分

摘要

For every \epsilon 0, and integer q = 3, we show that given an N-vertex graph that has an induced q-colorable sub graph of size (1-\epsilon)N, it is NP-hard to find an independent set of size N/q^2.

查看译文

关键词

approximation theory,graph colouring,optimisation,set theory,NP-hardness,V-vertex graph,colorable graph,independent sets finding,PCPs,graph coloring,hardness of approximation

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要