Login / Signup

NP-Completeness of Some Generalizations of the Maximum Matching Problem.

Larry J. StockmeyerVijay V. Vazirani
Published in: Inf. Process. Lett. (1982)
Keyphrases
  • maximum matching
  • bipartite graph
  • stable set
  • artificial intelligence
  • real world
  • machine learning
  • multi agent
  • training set
  • rough approximations