Pebble Games and Linear Equations
From MaRDI portal
Publication:4649553
DOI10.4230/LIPIcs.CSL.2012.289zbMath1252.03084OpenAlexW2134903653MaRDI QIDQ4649553
Publication date: 22 November 2012
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2012/3679/pdf/25.pdf
linear programmingfinite model theorygraph isomorphismSherali-Adams hierarchyfinite-variable logicsWeisfeiler-Lehman algorithm
Linear programming (90C05) Games involving graphs (91A43) Model theory of finite structures (03C13) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Limitations of Algebraic Approaches to Graph Isomorphism Testing ⋮ The QAP-polytope and the graph isomorphism problem ⋮ Graphs Identified by Logics with Counting ⋮ On Tinhofer’s Linear Programming Approach to Isomorphism Testing ⋮ Quantum and non-signalling graph isomorphisms
This page was built for publication: Pebble Games and Linear Equations