A lower bound on the independence number of a graph
Author/Authors :
Jochen Harant، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Pages :
5
From page :
239
To page :
243
Abstract :
A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given.
