Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. Cormode, G., Dark, J., & Konrad, C. In Lee, J., Rinaldi, G., & Mahjoub, A. R., editors, Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers, volume 10856, of Lecture Notes in Computer Science, pages 101–114, 2018. Springer.
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/iscopt/CormodeDK18,
  author    = {Graham Cormode and
               Jacques Dark and
               Christian Konrad},
  editor    = {Jon Lee and
               Giovanni Rinaldi and
               Ali Ridha Mahjoub},
  title     = {Approximating the Caro-Wei Bound for Independent Sets in Graph Streams},
  booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
               Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {10856},
  pages     = {101--114},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-96151-4\_9},
  doi       = {10.1007/978-3-319-96151-4\_9},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/iscopt/CormodeDK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0