A spectral assignment approach for the graph isomorphism problem
نویسندگان
چکیده
منابع مشابه
A Spectral Assignment Approach for the Graph Isomorphism Problem
In this paper, we propose a heuristic for the graph isomorphism problem that is based on the eigendecomposition of the adjacency matrices. It is well known, that the eigenvalues of the adjacency matrices of isomorphic graphs need to be identical. However, two graphs GA and GB can be isospectral but non-isomorphic. If the graphs possess repeated eigenvalues, which typically correspond to graph s...
متن کاملThe Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملOn the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملNew Invariants for the Graph Isomorphism Problem
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other wellknown methods could not compute (such as special Fürer Gadgets and point-line incidence graphs of finite projective planes of higher d...
متن کاملOn spectral properties for graph matching and graph isomorphism problems
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching problem is challenging from a computational point of view, and therefore different relaxations are commonly used. Although common relaxations techniques tend to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Inference: A Journal of the IMA
سال: 2018
ISSN: 2049-8764,2049-8772
DOI: 10.1093/imaiai/iay001