arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.0969cs.DM
收藏

图同构问题的谱配置方法

A Spectral Assignment Approach for the Graph Isomorphism Problem

Stefan Klus, Tuhin Sahai

摘要:

在本文中,我们提出了算法的图同构(GI)问题的基础上的特征分解的邻接矩阵。同构图的特征值是相同的。然而,两个图$ G_A $和$ G_B $可以是等谱的但不同构的。我们首先构造了一个友好图的图同构测试算法,然后将其推广到无歧义图。我们发现,同构可以通过解决线性分配问题。如果图具有重复的特征值,这通常对应于图的对称性,则找到同构要困难得多。通过反复扰动邻接矩阵和使用特征多面体的性质,可以打破图的对称性,并迭代地将$ G_A $的顶点分配给$ G_B $的顶点,只要存在可容许的分配。如果图是同构的,则可以使用这种启发式方法来构造将$ G_A $变换为$ G_B $的置换。这些方法将用几个指导性的例子加以说明。

英文摘要:

In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can be isospectral but non-isomorphic. We first construct a graph isomorphism testing algorithm for friendly graphs and then extend it to unambiguous graphs. We show that isomorphisms can be detected by solving a linear assignment problem. If the graphs possess repeated eigenvalues, which typically correspond to graph symmetries, finding isomorphisms is much harder. By repeatedly perturbing the adjacency matrices and by using properties of eigenpolytopes, it is possible to break symmetries of the graphs and iteratively assign vertices of $ G_A $ to vertices of $ G_B $, provided that an admissible assignment exists. This heuristic approach can be used to construct a permutation which transforms $ G_A $ into $ G_B $ if the graphs are isomorphic. The methods will be illustrated with several guiding examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑