A graph distance metric combining maximum common subgraph and minimum common supergraph

Bunke, 1997, On a relation between graph edit distance and maximum common subgraph, Pattern Recogn. Lett., 18, 689, 10.1016/S0167-8655(97)00060-3 Bunke, 1999, Error-correcting graph matching: on the influence of the underlying cost function, IEEE Trans. Pattern Anal., 21, 917, 10.1109/34.790431 Bunke, 1983, Inexact graph matching for structural pattern recognition, Pattern Recogn. Lett., 1, 245, 10.1016/0167-8655(83)90033-8 Bunke, 1998, A graph distance metric based on the maximal common subgraph, Pattern Recogn. Lett., 19, 255, 10.1016/S0167-8655(97)00179-7 Gold, 1996, A graduated assignment algorithm for graph matching, IEEE Trans. Pattern Anal., 18, 377, 10.1109/34.491619 Levi, 1972, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo, 9, 1 McGregor, 1982, Backtrack search algorithms and the maximal common subgraph problem, Software – Pract. Exper., 12, 23, 10.1002/spe.4380120103 Messmer, 1998, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. Pattern Anal., 20, 493, 10.1109/34.682179 Shapiro, 1981, Structural descriptions and inexact matching, IEEE Trans. Pattern Anal., 3, 504, 10.1109/TPAMI.1981.4767144 Tsai, 1979, Error-correcting isomorphism of attributed relational graphs for pattern analysis, IEEE Trans. Systems Man Cybernet., 9, 757, 10.1109/TSMC.1979.4310127 Wong, A.K.C., Akinniyi, F.A., 1983. An algorithm for the largest common subgraph isomorphism using the implicit net. In: Proc. Int. Conf. Systems, Man Cybernet., IEEE, pp. 197–201