Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
From MaRDI portal
Publication:6638107
DOI10.4230/LIPICS.ICALP.2023.101MaRDI QIDQ6638107
Publication date: 14 November 2024
linear programmingsemidefinite programmingtreewidthLasserre hierarchygraph isomorphismSherali-Adams hierarchyhomomorphism indistinguishability
Related Items (2)
Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability ⋮ Cutting planes width and the complexity of graph isomorphism refutations
This page was built for publication: Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638107)