Title of article :
An upper bound on the independence number of a graph computable in polynomial-time
Author/Authors :
Carlos J. Luz، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1995
Keywords :
Combinatorial optimization , graph theory , Quadratic programming , Maximum independent set
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
