An algorithm for finding an approximate solution to the subgraph isomorphism problem
An algorithm for finding an approximate solution to the subgraph isomorphism problem
The author considers the subgraph isomorphism problem under the restriction that both checked graphs have the same number of vertices. A proposed metric represents the distance between checked graphs. This metric allows the author to come to the problem of finding an optimal embedding of one of the graphs into the other. The proposed algorithm is an algorithm for finding an approximate solution for the problem. Conditions needed for the effectiveness of the algorithm are considered.
isomorphism of graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), Graph theory (including graph drawing) in computer science, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), graph distance metric
isomorphism of graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), Graph theory (including graph drawing) in computer science, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), graph distance metric