Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method.

David Gamarnik Tomasz Nowicki Grzegorz Swirszcz Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. 76-106 2006 28 Random Struct. Algorithms 1 http://dx.doi.org/10.1002/rsa.20072 db/journals/rsa/rsa28.html#GamarnikNS06