Login / Signup

Turán graphs with bounded matching number.

Noga AlonPeter Frankl
Published in: CoRR (2022)
Keyphrases
  • small number
  • case study
  • matching algorithm
  • graph matching
  • genetic algorithm
  • np hard
  • finite number
  • maximum number