On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

Samankaltaisia teoksia

• On approximate graph colouring and max-k-cut algorithms based on the θ-function
  Tekijä: Klerk, Etienne de., et al.
  Julkaistu: (2013)
• On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
  Tekijä: Sotirov, R., et al.
  Julkaistu: (2012)
• Approximation of the stability number of a graph via copositive programming
  Tekijä: de Klerk, E, et al.
  Julkaistu: (2002)
• Approximation of the stability number of a graph via copositive programming
  Tekijä: Klerk, Etienne de., et al.
  Julkaistu: (2011)
• On the max-cut of sparse random graphs
  Tekijä: Gamarnik, David, et al.
  Julkaistu: (2019)