Login / Signup

Tight lower bounds on the matching number in a graph with given maximum degree.

Michael A. HenningAnders Yeo
Published in: J. Graph Theory (2018)
Keyphrases
  • lower bound
  • upper bound
  • graph matching
  • maximum number
  • random graphs
  • constant factor
  • clustering algorithm
  • image registration
  • worst case
  • branch and bound
  • branch and bound algorithm