Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Algorithm to determine graph isomorphism of the basis of their transformation with the connectedness component taken into account

  • 15 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    V. K. Pogrebnoi, “On a method of determining graph isomorphism,” Kibernetika, No. 2, 7–13 (1982).

  2. 2.

    V. M. Kureichik and A. G. Korolev, “On a method of recognizing graph isomorphism,” Kibernetika, No. 2, 82–87 (1977).

  3. 3.

    V. M. Kureichik and A. G. Korolev, “Applications of a graph isomorphis algorithm to check out LIC diagrams,” Mikroelektronika,5, No. 5, 400–406 (1976).

  4. 4.

    B. V. Batalov and T. M. Magrupov, “Determination of the correspondence between a large integrated circuit and the electrical circuit in principle,” Mikroelektronika,3, No. 4, 305–311 (1974).

  5. 5.

    A. N. Melikhov, Oriented Graphs and Finite Automata [in Russian], Nauka, Moscow (1971).

  6. 6.

    V. P. Karelin and B. N. Mironov, “Algorithms of determine the isomorphism of homgeneous unoriented graphs,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 2, 145–148 (1975).

  7. 7.

    G. Salton, Automatic Processing, Storage, and Retrieval of Information [Russian translation], Sovetskoe Radio, Moscow (1973).

  8. 8.

    V. O. Vasin, “Algorithm to establish graph isomorphism,” Automation of the Logical Design of Digital Apparatus [in Russian], Inst. Kibern. Akad. Nauk Ukr. SSR, Kiev (1974), pp. 135–148.

  9. 9.

    D. G. Gornell and C. G. Gottlieb, “An afficient algorithm for graph isomorphism,” J. ACM,17, No. 1, 51–64 (1970).

  10. 10.

    G. Levi, “Grabh isomorphism: a heuristic edge-partitioning-oriented algorithm,” Computing,2, No. 4, 191–313 (1974).

  11. 11.

    R. Karp, “Convergence of combinatorial problems,” Kibernet. Sb., Nov. Ser. No. 12, 16–38 (1975).

  12. 12.

    A. Aho, J. Hopcroft, and J. Ullman, Construction and Analysis of Computational Algorithms [Russian translation], Mir, Moscow (1979).

Download references

Additional information

Translated from Kibernetika, No. 1, pp. 27–31, 46, January–February, 1987.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Korolev, A.G. Algorithm to determine graph isomorphism of the basis of their transformation with the connectedness component taken into account. Cybern Syst Anal 23, 33–39 (1987). https://doi.org/10.1007/BF01068800

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Graph Isomorphism
  • Determine Graph Isomorphism