A spectral assignment approach for the graph isomorphism problem

DOI10.1093/imaiai/iay001zbMath1470.05156arXiv1411.0969OpenAlexW3100180619MaRDI QIDQ5242859

Stefan Klus, Tuhin Sahai

Publication date: 7 November 2019

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.0969

zbMATH Keywords

linear assignment problemgraph isomorphism problemfriendly graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Computing Autotopism Groups of Partial Latin Rectangles ⋮ Spectral complexity of directed graphs and application to structural decomposition ⋮ Dynamical Systems Theory and Algorithms for NP-hard Problems ⋮ On the equivariance properties of self-adjoint matrices ⋮ Continuous relaxations for the traveling salesman problem

This page was built for publication: A spectral assignment approach for the graph isomorphism problem