Login / Signup

A characterization of graphs with given maximum degree and smallest possible matching number: II.

Michael A. HenningZekhaya B. Shozi
Published in: Discret. Math. (2022)
Keyphrases
  • maximum number
  • computational complexity
  • small number
  • matching algorithm
  • graph matching
  • random graphs
  • web services
  • bayesian networks
  • pattern matching
  • keypoints
  • graph theory
  • matching process
  • minimum distance