An upper bound on the independence number of a graph computable in polynomial-time.

Published in: Oper. Res. Lett. (1995)

Keyphrases

upper bound
lower bound
computational complexity
worst case
small number
constant factor
graph representation
pairwise
approximation algorithms
structured data
directed graph
maximum number
graph partitioning
nodes of a graph