Abstract
AbstractWe give a new, simplified and detailed account of the correspondence between levels of the Sherali–Adams relaxation of graph isomorphism and levels of pebble-game equivalence with counting (higher-dimensional Weisfeiler–Lehman colour refinement). The correspondence between basic colour refinement and fractional isomorphism, due to Tinhofer [22; 23] and Ramana, Scheinerman and Ullman [17], is re-interpreted as the base level of Sherali–Adams and generalised to higher levels in this sense by Atserias and Maneva [1] and Malkin [14], who prove that the two resulting hierarchies interleave. In carrying this analysis further, we here give (a) a precise characterisation of the level k Sherali–Adams relaxation in terms of a modified counting pebble game; (b) a variant of the Sherali–Adams levels that precisely match the k-pebble counting game; (c) a proof that the interleaving between these two hierarchies is strict. We also investigate the variation based on boolean arithmetic instead of real/rational arithmetic and obtain analogous correspondences and separations for plain k-pebble equivalence (without counting). Our results are driven by considerably simplified accounts of the underlying combinatorics and linear algebra.
Publisher
Cambridge University Press (CUP)
Reference24 articles.
1. A note on compact graphs
2. Graph isomorphism and theorems of Birkhoff type
3. A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
4. Tight integrality gaps for Lovász-Schrijver LP relaxations of vertex cover and max cut;Schoenebeck;Proceedings of the 39th ACM Symposium on Theory of Computing,2007
5. Linear level Lasserre lower bounds for certain k-CSPs;Schoenebeck;Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science,2008
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献