Metraipolis › archive › dc_c207eaddf524

A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring — Europe PMC PMID:32863433

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/32863433
DOI
10.1007/s10107-[numero omesso]-2
License (as archived)
solo-consultazione
Archived
2026-10-08T07:19:03.942Z
SHA-256 of the archived text
f387a50624e86d7a98fea08d4740a03c1743056a9b6a11c15aa6f31426092f7e
Stable URL of this page
https://metraipolis.com/documento/dc_c207eaddf524

How to cite

A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring — Europe PMC PMID:32863433 — Europe PMC (en), https://europepmc.org/article/MED/32863433 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_c207eaddf524 (Metraipolis archive dc_c207eaddf524, sha256 f387a50624e86d7a98fea08d4740a03c1743056a9b6a11c15aa6f31426092f7e)
BibTeX
@misc{dcc207eaddf524,
  title = {A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring — Europe PMC PMID:32863433},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/32863433},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_c207eaddf524; sha256 f387a50624e86d7a98fea08d4740a03c1743056a9b6a11c15aa6f31426092f7e},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/32863433. Agents can read the archived copy with the MCP tool read_document.