Login / Signup

Exponentially Many Monochromatic n-Matchings in K 3n-1.

Ni CaoHan Ren
Published in: Graphs Comb. (2012)
Keyphrases
  • computationally hard
  • neural network
  • information retrieval
  • weighted sums
  • three dimensional
  • training data
  • semi supervised