On a relation between graph edit distance and maximum common subgraph

Pattern Recognition Letters

Volumn 18, Issue 8, 1997, Pages 689-694

  Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Approximate graph matching; Cost function; Edit operation; Graph edit distance; Maximum common subgraph

Indexed keywords

COMPUTER VISION; ERROR CORRECTION; MATHEMATICAL TRANSFORMATIONS;

GRAPH EDIT DISTANCE; MAXIMUM COMMON SUBGRAPH;

GRAPH THEORY;

EID: 0031198630     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(97)00060-3     Document Type: Article

References (17)

1. Bunke, H., Allerman, G., 1983. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1 (4), 245-253.
2. Bunke, H., Messmer, B., 1997. Recent advances in graph matching. Internat. J. Pattern Recognition Artif. Intell. 11 (1), 169-203.
3. Cho, C.J., Kim, J.J., 1992. Recognizing 3-D objects by forward checking constrained tree search. Pattern Recognition Letters 13 (8), 587-597.
4. Christmas, W.J., Kittler, J., Petrou, M., 1995. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Machine Intell. 17 (8), 749-764.
5. Horaud, R., Skordas, T., 1989. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Pattern Anal. Machine Intell. 11 (11), 1168-1180.
6. Lee, S., Kim, J.H., 1989. Attributed stroke graph matching for seal imprint verification. Pattern Recognition Letters 9, 137-145.
7. Lee, S.W., Kim, J.H., Groen, F.C.A., 1990. Translation-, rotation-, and scale invariant recognition of hand-drawn symbols in schematic diagrams. Internat. J. Pattern Recognition Artif. Intell. 4 (1), 1-15.
8. Levinson, R., 1992. Pattern associativity and the retrieval of semantic networks. Comput. Math. Appl. 23, 573-600.
9. Lu, S.W., Ren, Y., Suen, C.Y., 1991. Hierarchical attributed graph representation and recognition of handwritten Chinese characters. Pattern Recognition 24, 617-632.
10. Pearce, A., Caelli, T., Bischof, W.F., 1994. Rulegraphs for graph matching in pattern recognition. Pattern Recognition 27 (9), 1231-1246.
11. Read, R.C., Corneil, D.G., 1977. The graph isomorphism disease. J. Graph Theory 1, 339-363.
12. Rice, S., Bunke, H., Nartker, T., 1997. Classes of cost functions for string matching. Algorithmica 18 (2), 271-280.
13. Sanfeliu, A., Fu, K.S., 1983. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Systems Man Cybernet. 13, 353-363.
14. Shapiro, L.G., Haralick, R.M., 1981. Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Machine Intell. 3, 504-519.
15. Ullman, J.R., 1976. An algorithm for subgraph isomorphism. J. ACM 23 (1), 31-42.
16. Wagner, R.A., Fischer, M.J., 1974. The string-to-string correction problem. J. ACM 21 (1), 168-173.
17. Wong, E.K., 1992. Model matching in robot vision by subgraph isomorphism. Pattern Recognition 25 (3), 287-304.