Computer Science – Computational Complexity
Scientific paper
2010-10-31
Computer Science
Computational Complexity
Scientific paper
We prove new lower bounds on the likely size of a maximum independent set in
a random graph with a given average degree. Our method is a weighted version of
the second moment method, where we give each independent set a weight based on
the total degree of its vertices.
Dani Varsha
Moore Cristopher
No associations
LandOfFree
Independent sets in random graphs from the weighted second moment method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Independent sets in random graphs from the weighted second moment method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Independent sets in random graphs from the weighted second moment method will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-663939