论文信息 - A note on the derivation of maximal common subgraphs of two directed or undirected graphs

A note on the derivation of maximal common subgraphs of two directed or undirected graphs

In this note the problem is considered of finding maximal common subgraphs of two given graphs. A technique is described by which this problem can be stated as a problem of deriving maximal compatibility classes. A known «maximal compatibility classes» algorithm can then be used to derive maximal common subgraphs.The same technique is shown to apply to the classical subgraph isomorphism problem.

G. Levi

[1] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..

[2] Gerald Salton,et al. Some flexible information retrieval systems using structure matching procedures , 1964, AFIPS '64 (Spring).

[3] Stephen H. Unger,et al. GIT—a heuristic program for testing pairs of directed line graphs for isomorphism , 1964, CACM.

[4] Edward H. Sussenguth. A Graph-Theoretic Algorithm for Matching Chemical Structures. , 1965 .

[5] A. Grasselli,et al. A note on the derivation of maximal compatibility classes , 1966 .

[6] A. Grasselli,et al. An approximate method for the synthesis of multiple-output combinational networks , 1966 .

[7] D. Corneil,et al. An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[8] R. Morpurgo. Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati , 1971 .

[9] Franco Sirovich,et al. Isomorfismo fra grafi: Un algoritmo efficiente per trov are tutti gli isomorfismi , 1971 .

[10] G. Levi,et al. A weighted graph embedding technique and its application to automatic circuit Layout , 1971 .

[11] Fabrizio Luccio,et al. A technique for graph embedding with constraints on node and arc correspondences , 1973, Inf. Sci..