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. Random Struct. Algorithms, 28(1):76-106, 2006. [doi]

@article{GamarnikNS06,
  title = {Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method},
  author = {David Gamarnik and Tomasz Nowicki and Grzegorz Swirszcz},
  year = {2006},
  doi = {10.1002/rsa.20072},
  url = {http://dx.doi.org/10.1002/rsa.20072},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GamarnikNS06},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {28},
  number = {1},
  pages = {76-106},
}