Login / Signup

An exact algorithm for maximum independent set in degree-5 graphs.

Mingyu XiaoHiroshi Nagamochi
Published in: Discret. Appl. Math. (2016)
Keyphrases
  • maximum independent set
  • graph theory
  • graph theoretic
  • independent set
  • random graphs
  • shortest path problem
  • column generation
  • clustering coefficient
  • power law
  • exact algorithms