Independent sets in random graphs from the weighted second moment method - Computer Science > Computational ComplexityReportar como inadecuado




Independent sets in random graphs from the weighted second moment method - Computer Science > Computational Complexity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We prove new lower bounds on the likely size of a maximum independent set ina random graph with a given average degree. Our method is a weighted version ofthe second moment method, where we give each independent set a weight based onthe total degree of its vertices.



Autor: Varsha Dani, Cristopher Moore

Fuente: https://arxiv.org/







Documentos relacionados