Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FOCS
2010
IEEE

favoriteEmaildiscussreport

140views Theoretical Computer Science» more FOCS 2010»

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

13 years 2 months ago

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Download www.cims.nyu.edu

Irit Dinur, Subhash Khot, Will Perkins, Muli Safra

Real-time Traffic

FOCS 2010 | Theoretical Computer Science |

claim paper

Related Content

» A spectral technique for coloring random 3colorable graphs preliminary version

» Testing kwise and almost kwise independence

» Finding Large Independent Sets in Polynomial Expected Time

» Multidimensional Packing with Conflicts

» Twodimensional packing with conflicts

» Almost random graphs with simple hash functions

» Deciding Relaxed TwoColorability A Hardness Jump

» Parameterized Complexity of Finding Subgraphs with Hereditary Properties

» New Tools for Graph Coloring

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Irit Dinur, Subhash Khot, Will Perkins, Muli Safra

Comments (0)