A note on the P-time algorithms for solving the maximum independent set problem

Navid Nasr Esfahani, Parisa Mazrooei, Kaveh Mahdaviani, Behnaz Omoomi. A note on the P-time algorithms for solving the maximum independent set problem. In Proceedings of the 2nd Conference on Data Mining and Optimization, DMO 2009, Universiti Kebangsaan Malaysia, 27-28 October 2009. pages 65-70, IEEE, 2009. [doi]

@inproceedings{EsfahaniMMO09,
  title = {A note on the P-time algorithms for solving the maximum independent set problem},
  author = {Navid Nasr Esfahani and Parisa Mazrooei and Kaveh Mahdaviani and Behnaz Omoomi},
  year = {2009},
  doi = {10.1109/DMO.2009.5341909},
  url = {http://dx.doi.org/10.1109/DMO.2009.5341909},
  researchr = {https://researchr.org/publication/EsfahaniMMO09},
  cites = {0},
  citedby = {0},
  pages = {65-70},
  booktitle = {Proceedings of the 2nd Conference on Data Mining and Optimization, DMO 2009, Universiti Kebangsaan Malaysia, 27-28 October 2009},
  publisher = {IEEE},
  isbn = {978-1-4244-4944-6},
}