An Efficient Algorithm for Graph Isomorphism 论文
1970Journal of the ACM引用 332
Complexity and Algorithms in GraphsAlgorithms and Data CompressionOptimization and Search Problems
摘要
A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representative graph and the reordered graph, are derived.