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

類似資料

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