An upper bound on the independence number of a graph computable in polynomial-time

Carlos J. Luz. An upper bound on the independence number of a graph computable in polynomial-time. Oper. Res. Lett., 18(3):139-145, 1995. [doi]

@article{Luz95,
  title = {An upper bound on the independence number of a graph computable in polynomial-time},
  author = {Carlos J. Luz},
  year = {1995},
  doi = {10.1016/0167-6377(95)00042-9},
  url = {http://dx.doi.org/10.1016/0167-6377(95)00042-9},
  researchr = {https://researchr.org/publication/Luz95},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {18},
  number = {3},
  pages = {139-145},
}