Login / Signup

Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees.

Manouchehr Zaker
Published in: Discret. Appl. Math. (2016)
Keyphrases
  • lower bound
  • small number
  • upper bound
  • maximum number
  • neural network
  • optimal solution
  • worst case
  • branch and bound algorithm