Sherali-Adams Relaxations of Graph Isomorphism Polytopes release_k74txpbxtzejxhq6scssepm5em

by Peter N. Malkin

Released as a article .

2011  

Abstract

We investigate the Sherali-Adams lift & project hierarchy applied to a graph isomorphism polytope whose integer points encode the isomorphisms between two graphs. In particular, the Sherali-Adams relaxations characterize a new vertex classification algorithm for graph isomorphism, which we call the generalized vertex classification algorithm. This algorithm generalizes the classic vertex classification algorithm and generalizes the work of Tinhofer on polyhedral methods for graph automorphism testing. We establish that the Sherali-Adams lift & project hierarchy when applied to a graph isomorphism polytope needs Omega(n) iterations in the worst case before converging to the convex hull of integer points. We also show that this generalized vertex classification algorithm is also strongly related to the well-known Weisfeiler-Lehman algorithm, which we show can also be characterized in terms of the Sherali-Adams relaxations of a semi-algebraic set whose integer points encode graph isomorphisms.
In text/plain format

Archived Files and Locations

application/pdf  466.8 kB
file_5iduobqafnbshcnzjo5ptxogwa
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2011-07-20
Version   v2
Language   en ?
arXiv  1107.0632v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 10175875-b91f-420b-bbb1-a0e2a2fdebf9
API URL: JSON