A heuristic algorithm of recognition of isomorphism of graphs

被引:0
|
作者
Glibovets N.N. [1 ]
Ivashchenko S.A. [1 ]
机构
[1] National University Kievo-Mogilyanskaya Akademiya, Kiev
关键词
Graph isomorphism; Heuristic algorithm; Recognition of isomorphism of graphs;
D O I
10.1023/A:1016632503967
中图分类号
学科分类号
摘要
A heuristic polynomial algorithm is presented, which is used for the recognition of isomorphism of graphs and can be assigned to the group of methods that use local characteristic invariants of graphs. At each step, the behavior of the algorithm depends on information obtained at its previous steps. All the theorems stated are proved for a class of nonoriented graphs. © 2001 Kluwer Academic/Plenum Publishers.
引用
收藏
页码:138 / 143
页数:5
相关论文
共 50 条