Login / Signup

MAX k-CUT and Approximating the Chromatic Number of Random Graphs.

Amin Coja-OghlanCristopher MooreVishal Sanwalani
Published in: ICALP (2003)
Keyphrases
  • random graphs
  • color images
  • upper bound
  • worst case
  • heuristic search
  • phase transition
  • graph theoretic