Efficient Computation of a Near-Maximum Independent Set over Evolving Graphs

Weiguo Zheng, Qichen Wang, Jeffrey Xu Yu, Hong Cheng, Lei Zou 0001. Efficient Computation of a Near-Maximum Independent Set over Evolving Graphs. In 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16-19, 2018. pages 869-880, IEEE Computer Society, 2018. [doi]

@inproceedings{ZhengWYC018,
  title = {Efficient Computation of a Near-Maximum Independent Set over Evolving Graphs},
  author = {Weiguo Zheng and Qichen Wang and Jeffrey Xu Yu and Hong Cheng and Lei Zou 0001},
  year = {2018},
  doi = {10.1109/ICDE.2018.00083},
  url = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2018.00083},
  researchr = {https://researchr.org/publication/ZhengWYC018},
  cites = {0},
  citedby = {0},
  pages = {869-880},
  booktitle = {34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16-19, 2018},
  publisher = {IEEE Computer Society},
  isbn = {978-1-5386-5520-7},
}