Login / Signup

On pairwise compatibility graphs having Dilworth number two.

Tiziana CalamoneriRossella Petreschi
Published in: Theor. Comput. Sci. (2014)
Keyphrases
  • pairwise
  • small number
  • databases
  • pattern recognition
  • computational complexity
  • higher order
  • multi class
  • machine learning
  • graph matching
  • random graphs