Login / Signup

An effective compact formulation of the max cut problem on sparse graphs.

Giuseppe LanciaPaolo Serafini
Published in: Electron. Notes Discret. Math. (2011)
Keyphrases
  • sparse data
  • max cut
  • graph matching
  • feature selection
  • pairwise
  • directed graph
  • complex structures
  • random graphs
  • graph embedding