, 9:341 | Cite as

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.


Directed Graph Adjacency Matrix Undirected Graph Label Graph Subgraph Isomorphism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    Unger, S. H.,GIT, a heuristic program for testing pairs of directed line graphs for isomorphism, Comm. ACM7 (1964), 26–34.zbMATHCrossRefGoogle Scholar
  2. [2]
    Sussenguth, E. H. Jr.,A graph-theoretical algorithm for matching chemical structures, J. Chem. Doc.5 (1965), 36–43.CrossRefGoogle Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    Corneil, D. G. andGotlieb, C.C.,An efficient algorithm for graph isomorphism, J. ACM17 (1970), 51–64.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Morpurgo, R.,Un metodo euristico per la verifica dell’isomorfismo di due grafi non orientati, Calcolo8 (1971), 1–31.zbMATHMathSciNetGoogle Scholar
  6. [6]
    Sirovich, F.,Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi, Calcolo8 (1971), 301–337.MathSciNetGoogle Scholar
  7. [7]
    Levi, G. andLuccio, F.,A technique for graph embedding with constraints on node and arc correspondences, Information Sciences5 (1973), 1–23.CrossRefMathSciNetGoogle Scholar
  8. [8]
    Levi, G. andLuccio, F.,A weighted graph embedding technique and its application to automatic circuit layout, Calcolo8 (1971), 49–60.zbMATHGoogle Scholar
  9. [9]
    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.CrossRefGoogle Scholar
  10. [10]
    Grasselli, A.,A note on the derivation of maximal compatibility classes, Calcolo3 (1966), 165–176.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    Wolfberg, M. S.,Determination of maximally complete subgraphs, Moore School of E E., Rept. n. 65-27, Univ. of Pennsylvania, Philadelphia, Penn. (1965).Google Scholar

Copyright information

© Instituto di Elaborazione della Informazione del CNR 1973

Authors and Affiliations

  • G. Levi
    • 1
  1. 1.Istituto di Elaborazione della Informazione del C.N.R.Pisa

Personalised recommendations