Matching graphs by pivoting

Pattern Recognition Letters

Volumn 24, Issue 8, 2003, Pages 1099-1106

  Massaro, Alessio ^a   Pelillo, Marcello ^b  

^a Thermo Fisher Scientific   (United States)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Graph matching; Linear complementarity problem; Maximum clique; Maximum common subgraph; Pivoting; Quadratic programming

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; LINEAR ALGEBRA; PROBLEM SOLVING;

QUADRATIC FORMATION;

PATTERN MATCHING;

GRAPHICAL METHOD;

EID: 0037408051     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00256-8     Document Type: Article

References (19)

1. Ambler, A.P. et al., 1973. A versatile computer-controlled assembly system. In: Proc. 3rd Int. J. Conf. Artif. Intell., Stanford, CA, pp. 298-307.
2. Barrow, H.G., Burstall, R.M., 1976. Subgraph isomorphism, matching relational structures and maximal cliques. Inform. Process. Lett. 4 (4), 83-84.
3. Bomze, I.M., 1997. Evolution towards the maximum clique. J. Global Optim. 10, 143-164.
4. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M., 1999. The maximum clique problem. In: Du, D.-Z., Pardalos, P.M., (Eds.), Handbook of Combinatorial Optimization- Supplement, vol. A. Kluwer Academic Publishers, Dordrecht, pp. 1-74.
5. Bunke, H., 2000. Recent developments in graph matching. In: Proceedings of 15th International Conference on Pattern Recognition, vol. 2. IEEE Computer Society Press, pp. 117- 124.
6. Cottle, R.W., Pang, J., Stone, R.E., 1992. The Linear Complementarity Problem. Academic Press, Boston, MA.
7. Gold, S., Rangarajan, A., 1996. A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Machine Intell. 18 (4), 377-388.
8. Li, S.Z., 1992. Matching: invariant to translations, rotations, and scale changes. Pattern Recognition 25, 583-594.
9. Massaro, A., Pelillo, M., Bomze, I.M. A complementary pivoting approach to the maximum weight clique problem. SIAM J. Optim. 12 (4), 928-948.
10. Messmer, B., Bunke, H., 1998. A new algorithm for error tolerant subgraph isomorphism. IEEE Trans. Pattern Anal. Machine Intell. 20, 493-505.
11. Motzkin, T.S, Straus, E.G., 1965. Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17 (4), 533-540.
12. Pelillo, M., 1998. A unifying framework for relational structure matching. In: Proceedings of 14th International Conference on Pattern Recognition. IEEE Computer Society Press, pp. 1316-1319.
13. Pelillo, M., 1999. Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11, 1933-1955.
14. Pelillo, M. Matching free trees, maximal cliques, and monotone game dynamics. IEEE Trans. Pattern Anal. Machine Intell., in press.
15. Pelillo, M., Siddiqi, K., Zucker, S.W., 1999. Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Machine Intell. 21 (11), 1105- 1120.
16. Arcelli, C., Siddiqi, K., Zucker, S.W., 2001. Many-to-many matching of attributed trees using association graphs and game dynamics. In: Cordella, L.P., Sanniti di Baja, G. (Eds.), Visual Form 2001. Springer, Berlin, pp. 583- 593.
17. Shapiro, L.G, Haralick, R.M., 1981. Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Machine Intell. 3, 504-519.
18. Tsai, W.-H., Fu, K.-S., 1983. Subgraph error-correcting isomorphisms for syntactic pattern recognition. IEEE Trans. Systems Man Cybernet. 13, 48-62.
19. Wilson, R.C., Hancock, E.R., 1997. Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Machine Intell. 19 (6), 634-648.