Sciweavers

Share
MFCS
2007
Springer

Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs

12 years 7 months ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one as the size of the graph tends to infinity.
William Duckworth, Michele Zito
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where MFCS
Authors William Duckworth, Michele Zito
Comments (0)
books