This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. N. Melikhov, Oriented Graphs and Finite Automata [in Russian], Nauka, Moscow (1971).
A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Novosibirsk (1969).
G. Salton, Automatic Information Organization and Retrieval, McGraw-Hill, New York (1968).
V. F. Guzik, V. P. Karelin, and B. I. Mironov, “On the isomorphic embedding of networks of digital integrators into homogeneous digital integrating structures with incorrectly switching elements,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4 (1973).
A. A. Borovnikov, “The development and machine simulation of algorithms on graphs, used to investigate interaction processes of elementary particles,” Author's Abstract of Candidate's Dissertation, Moscow (1972).
D. G. Cornell and C. G. Gotlieb, “An efficient algorithm for graph isomorphism,” J. Assoc. Comput. Mach., 17, No. 1 (1970).
Additional information
Translated from Kibernetika, No. 2, pp. 82–87, March–April, 1977.
Rights and permissions
About this article
Cite this article
Kureichik, V.M., Korolev, A.G. A method for the recognition of graph isomorphism. Cybern Syst Anal 13, 230–236 (1977). https://doi.org/10.1007/BF01073316
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01073316