Login / Signup

A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number.

Michael A. HenningZekhaya B. Shozi
Published in: J. Graph Theory (2021)
Keyphrases
  • lower bound
  • upper bound
  • small number
  • computer vision
  • graph matching
  • maximum number
  • data sets
  • objective function
  • optimal solution
  • special case
  • np hard
  • dynamic programming