Sign in

A probabilistic result for the max-cut problem on random graphs.

Amir BeckMarc Teboulle
Published in: Oper. Res. Lett. (2000)
Keyphrases
  • random graphs
  • graph theoretic
  • learning curves
  • phase transition
  • bayesian networks
  • probabilistic model
  • random walk