Sharp bounds on the order, size, and stability number of graphs.

Pierre Hansen Maolin Zheng

Published in: Networks (1993)

Keyphrases

maximum number
computational complexity
small number
space complexity
grow exponentially
largest number
real time
high quality
lower bound
pairwise
multi class
shortest path
memory requirements
closed form expressions