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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.