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
Pages
7
From page
139
To page
145
Keywords
Combinatorial optimization , graph theory , Quadratic programming , Maximum independent set
Journal title
Operations Research Letters
Serial Year
1995
Journal title
Operations Research Letters
Record number
136987
Link To Document