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

Unger, S. H.,GIT, a heuristic program for testing pairs of directed line graphs for isomorphism, Comm. ACM7 (1964), 26–34.

Sussenguth, E. H. Jr.,A graph-theoretical algorithm for matching chemical structures, J. Chem. Doc.5 (1965), 36–43.

Salton, G. andSussenguth, E. H. Jr.,Some flexible information retrieval systems using structure matching procedures, Proc. AFIPS 1964 SJCC25 (1964), Spartan Books, New York, 587–598.

Corneil, D. G. andGotlieb, C.C.,An efficient algorithm for graph isomorphism, J. ACM17 (1970), 51–64.

Morpurgo, R.,Un metodo euristico per la verifica dell’isomorfismo di due grafi non orientati, Calcolo8 (1971), 1–31.

Sirovich, F.,Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi, Calcolo8 (1971), 301–337.

Levi, G. andLuccio, F.,A technique for graph embedding with constraints on node and arc correspondences, Information Sciences5 (1973), 1–23.

Levi, G. andLuccio, F.,A weighted graph embedding technique and its application to automatic circuit layout, Calcolo8 (1971), 49–60.

Paull, M. C. andUnger, S. H.,Minimizing the number of states in incompletely specified sequential switching functions, IRE Trans. on Electronic Computers8 (1959), 356–367.

Grasselli, A.,A note on the derivation of maximal compatibility classes, Calcolo3 (1966), 165–176.

Wolfberg, M. S.,Determination of maximally complete subgraphs, Moore School of E E., Rept. n. 65-27, Univ. of Pennsylvania, Philadelphia, Penn. (1965).