Login / Signup

On the expected number of edges in a maximum matching of an (r, s)-tree.

J. H. ChoEdgar M. Palmer
Published in: Int. J. Comput. Math. (1995)
Keyphrases
  • maximum matching
  • small number
  • bipartite graph
  • computational complexity
  • stable set
  • machine learning
  • reinforcement learning
  • search algorithm
  • lower bound