A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- 475 Downloads
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.
KeywordsDirected Graph Adjacency Matrix Undirected Graph Label Graph Subgraph Isomorphism
- 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
- 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