Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling

Lijun Chang, Wei Li, Wenjie Zhang. Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. In Semih Salihoglu, Wenchao Zhou, Rada Chirkova, Jun Yang 0001, Dan Suciu, editors, Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, May 14-19, 2017. pages 1181-1196, ACM, 2017. [doi]

@inproceedings{ChangLZ17-0,
  title = {Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling},
  author = {Lijun Chang and Wei Li and Wenjie Zhang},
  year = {2017},
  doi = {10.1145/3035918.3035939},
  url = {http://doi.acm.org/10.1145/3035918.3035939},
  researchr = {https://researchr.org/publication/ChangLZ17-0},
  cites = {0},
  citedby = {0},
  pages = {1181-1196},
  booktitle = {Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, May 14-19, 2017},
  editor = {Semih Salihoglu and Wenchao Zhou and Rada Chirkova and Jun Yang 0001 and Dan Suciu},
  publisher = {ACM},
  isbn = {978-1-4503-4197-4},
}