Sciweavers

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

8

COCO
2001
Springer

favoriteEmaildiscussreport

101views Algorithms» more COCO 2001»

Resolution Complexity of Independent Sets in Random Graphs

13 years 9 months ago

Resolution Complexity of Independent Sets in Random Graphs

Download www.cs.cornell.edu

Paul Beame, Russell Impagliazzo, Ashish Sabharwal

Real-time Traffic

Algorithms | COCO 2001 |

claim paper

Related Content

» The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs

» Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs

» Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets i...

» Resolution Proofs Exponential Bounds and Kolmogorov Complexity

» Uncover Low Degree Vertices and Minimise the Mess Independent Sets in Random Regular Graph...

» Approximating Independent Set in SemiRandom Graphs

» Finding a Maximum Independent Set in a Sparse Random Graph

» Maximum Weight Independent Sets and Matchings in Sparse Random Graphs Exact Results Using ...

» PTAS for maximum weight independent set problem with random weights in bounded degree grap...

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	COCO
Authors	Paul Beame, Russell Impagliazzo, Ashish Sabharwal

Comments (0)