A lower bound on the independence number of a graph.

Published in: Discret. Math. (1998)

Keyphrases

lower bound
small number
computational complexity
image segmentation
upper bound
constant factor
data sets
optimal solution
special case
worst case
random walk
bipartite graph