Login / Signup

An improved linear bound on the number of perfect matchings in cubic graphs.

Louis EsperetDaniel Král'Petr SkodaRiste Skrekovski
Published in: Eur. J. Comb. (2010)
Keyphrases
  • fixed number
  • small number
  • least squares
  • neural network
  • computational complexity
  • pairwise
  • upper bound
  • graphical models
  • closed form
  • maximum number