A note on the derivation of maximal common subgraphs of two directed or undirected graphs
作者： G. Levi
DOI: 10.1007/BF02575586
关键词:
摘要: In this note the problem is considered of finding maximal common subgraphs two given graphs. A technique described by which can be stated as a deriving compatibility classes. known «maximal classes» algorithm then used to derive subgraphs. The same shown apply classical subgraph isomorphism problem.
springer.com
sci-hub.se 参考文章(11)
Giorgio Levi, Fabrizio Luccio, A technique for graph embedding with constraints on node and arc correspondences Information Sciences. ,vol. 5, pp. 1- 24 ,(1973) , 10.1016/0020-0255(73)90001-7
Stephen H. Unger, GIT—a heuristic program for testing pairs of directed line graphs for isomorphism Communications of the ACM. ,vol. 7, pp. 26- 34 ,(1964) , 10.1145/363872.363899
Edward H. Sussenguth, A Graph-Theoretic Algorithm for Matching Chemical Structures. Journal of Chemical Documentation. ,vol. 5, pp. 36- 43 ,(1965) , 10.1021/C160016A007
A. Grasselli, R. Stefanelli, An approximate method for the synthesis of multiple-output combinational networks Calcolo. ,vol. 3, pp. 347- 368 ,(1966) , 10.1007/BF02576017
Franco Sirovich, Isomorfismo fra grafi: Un algoritmo efficiente per trov are tutti gli isomorfismi Calcolo. ,vol. 8, pp. 301- 337 ,(1971) , 10.1007/BF02575800
A. Grasselli, A note on the derivation of maximal compatibility classes Calcolo. ,vol. 2, pp. 165- 176 ,(1966) , 10.1007/BF02575691
R. Morpurgo, Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati Calcolo. ,vol. 8, pp. 1- 31 ,(1971) , 10.1007/BF02575571
G. Levi, F. Luccio, A weighted graph embedding technique and its application to automatic circuit Layout Calcolo. ,vol. 8, pp. 49- 60 ,(1971) , 10.1007/BF02575573
M. C. Paull, S. H. Unger, Minimizing the Number of States in Incompletely Specified Sequential Switching Functions Ire Transactions on Electronic Computers. ,vol. 8, pp. 356- 367 ,(1959) , 10.1109/TEC.1959.5222697
Gerald Salton, Edward H. Sussenguth, Some flexible information retrieval systems using structure matching procedures Proceedings of the April 21-23, 1964, spring joint computer conference on XX - AFIPS '64 (Spring). pp. 587- 597 ,(1964) , 10.1145/1464122.1464178