A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring

Elisabeth Gaar, Franz Rendl. A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program., 183(1):283-308, 2020. [doi]

@article{GaarR20,
  title = {A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring},
  author = {Elisabeth Gaar and Franz Rendl},
  year = {2020},
  doi = {10.1007/s10107-020-01512-2},
  url = {https://doi.org/10.1007/s10107-020-01512-2},
  researchr = {https://researchr.org/publication/GaarR20},
  cites = {0},
  citedby = {0},
  journal = {Math. Program.},
  volume = {183},
  number = {1},
  pages = {283-308},
}