Login / Signup

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.

Daniel KrálJean-Sébastien SereniMichael Stiebitz
Published in: SIAM J. Discret. Math. (2009)
Keyphrases
  • lower bound
  • upper bound
  • small number
  • fixed number
  • maximum number
  • random graphs
  • learning algorithm
  • search algorithm
  • computational complexity
  • b spline
  • branch and bound algorithm