Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
A. Ya. Petrenyuk, “Application of invariants in combinatorial investigations,” Voprosy Kibernetiki, 129–135, Izd. Akad. Nauk SSSR, Moscow (1973).
V. N. Zemlyachenko,N. M. Korniyenko, andR. I. Tyshkevich, “The problem of isomorphism of graphs,” Proc. LOMI Sci. Sem., Vol. 118, Nauka, Leningrad (1972).
M. I. Nechipurenko,V. K. Popkov,S. M. Nainagashev, et al., Algorithms and Programs of Problem Solving on Graphs and Networks [in Russian], Nauka, Novosibirsk (1990).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Glibovets, N.N., Ivashchenko, S.A. A Heuristic Algorithm of Recognition of Isomorphism of Graphs. Cybernetics and Systems Analysis 37, 138–143 (2001). https://doi.org/10.1023/A:1016632503967
Issue Date:
DOI: https://doi.org/10.1023/A:1016632503967