Abstract
We present an integer linear program (IP), for the Graph Isomorphism (GI) problem, which has non-empty feasible solution if and only if the input pair of graphs are isomorphic. We study the polytope of the convex hull of the solution points of IP, denoted by \(\mathcal{B}^{[2]}\). Exponentially many facets of this polytope are known. We show that in case of non-isomorphic pairs of graphs if a feasible solution exists for the linear program relaxation (LP) of the IP, then it violates a unique facet of \(\mathcal{B}^{[2]}\). We present an algorithm for GI based on the solution of LP and prove that it detects non-isomorphism in polynomial time if the solution of the LP violates any of the known facets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arvind, V., Torán, J.: Isomorphism testing: Perspective and open problems. Bulletin of the EATCS 86, 66–84 (2005)
Aurora, P.K., Mehta, S.K.: New Facets of the QAP-Polytope. ArXiv e-prints (September 2014)
Babai, L., Kucera, L.: Canonical labelling of graphs in linear average time. In: FOCS, pp. 39–46 (1979)
Babai, L., Luks, E.M.: Canonical labeling of graphs. In: STOC, pp. 171–183 (1983)
Babai, L., Erdös, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput., 628–635 (1980)
Fortin, S.: The graph isomorphism problem. Technical report, University of Alberta (1996)
Kaibel, V.: Polyhedral Combinatorics of the Quadratic Assignment Problem. PhD thesis, Faculty of Mathematics and Natural Sciences, University of Cologne (1997)
Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Technical report, Cowles Foundation, Yale University (1955)
Lawler, E.L.: The quadratic assignment problem. Management Science 9(4), 586–599 (1963)
Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optimization 6(3), 231–241 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Aurora, P., Mehta, S.K. (2014). A Geometric Approach to Graph Isomorphism. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-319-13075-0_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13074-3
Online ISBN: 978-3-319-13075-0
eBook Packages: Computer ScienceComputer Science (R0)