Bounds on the independence number of a graph in terms of order, size and maximum degree.

Nader Jafari Rad Elahe Sharifi

Published in: Discret. Appl. Math. (2017)

Keyphrases

maximum number
computational complexity
information retrieval
constant factor
grow exponentially
similarity measure
lower bound
co occurrence
small number
memory requirements
graph theory
space complexity
leaf nodes
network size