Login / Signup

Targeted Branching for the Maximum Independent Set Problem.

Demian HespeSebastian LammChristian Schorr
Published in: SEA (2021)
Keyphrases
  • maximum independent set
  • graph theory
  • graph theoretic
  • independent set
  • branch and bound
  • search tree
  • special case
  • machine learning
  • search algorithm
  • bayesian networks
  • lower bound
  • target audience