Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
From MaRDI portal
Publication:6601300
DOI10.46298/theoretics.24.20zbMath1547.05201MaRDI QIDQ6601300
David E. Roberson, Tim Seppelt
Publication date: 10 September 2024
Published in: TheoretiCS (Search for Journal in Brave)
linear programmingsemidefinite programmingtreewidthLasserre hierarchygraph isomorphismSherali-Adams hierarchyhomomorphism indistinguishability
Linear programming (90C05) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability