Swap strategies for graph matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2726, Issue , 2003, Pages 142-153

  Fosser, Paolo ^a   Glantz, Roland ^a   Locatelli, Marco ^b   Pelillo, Marcello ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; PATTERN RECOGNITION;

ASSOCIATION GRAPH; ENERGY MINIMIZATION; GRAPH MATCHINGS; GREEDY ALGORITHMS; GREEDY STRATEGIES; MAXIMAL CLIQUE; QUALITY OF SOLUTION; RANDOM GRAPHS;

PATTERN MATCHING;

EID: 35248831761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45028-9_13     Document Type: Article

References (22)

1. A. P. Ambler et al. A versatile computer-controlled assembly system. In Proc. of 3rd Int. J. Conf. Art. Intell., pages 298-307, 1973.
2. H. G. Barrow and R. M. Burstall. Subgraph isomorphism, matching relational structures and maximal cliques. Inform. Process. Lett., 4(4):83-84, 1976.
3. R. Battiti and M. Protasi. Reactive local search for the maximum clique problem. Algorithmica, 29:610-637, 2001.
4. I. M. Bomze, M. Budinich, M. P. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization (Suppl. Vol. A), pages 1-74. Kluwer, Boston, MA, 1999.
5. M. Brockington and J. C. Culberson. Camouflaging independent sets in quasi-random graphs. In D. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability, volume 26 of DIMACS series in Discrete Mathematics and Theoretical Computer Science, pages 75-88. Americ. Math. Soc., 1996.
6. C. Bron and J. Kerbosch. Algorithm457: Finding all cliques of an undirected graph. Comm. ACM, 16:575-577, 1973.
7. H. Bunke. Recent developments in graph matching. In A. Sanfeliu, J. Villanueva, M. Vanrell, R. Alquezar, A. Jain, and J. Kittler, editors, Proc. 15th Int. Conf. Pattern Recognition, volume 2, pages pp. 117-124. IEEE Computer Society, 2000.
8. R. W. Cottle, J.-S. Pang, and R. E. Stone. The Linear Complementarity Problem. Accademic Press, Boston, MA, 1992.
9. S. Gold and A. Rangarajan. A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. Pattern Anal. and Machine Intell., 18(4):377-388, 1996.
10. S. Z. Li. Matching: invariant to translations, rotations and scale changes. Pattern Recogognition, 25(6):583-594, 1992.
11. M. Locatelli, I. M. Bomze, and M. Pelillo. Swaps, diversification, and the combinatorics of pivoting for the maximum weight clique. Technical Report CS-2002-12, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 30172 Venezia Mestre, Italy, 2002.
12. A. Massaro and M. Pelillo. Matching graphs by pivoting. Pattern Recognition Letters, 24:1099-1106, 2003.
13. A. Massaro, M. Pelillo, and I. M. Bomze. A complementary pivoting approach to the maximum weight clique problem: SIAM Journal on Optimization, 12(4):928-948, 2002.
14. B. Messmer and H. Bunke. A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, 20(7):493-504, 1998.
15. T. S. Motzkin and E. G. Straus. Maxima for graphs and a new proof of a theorem of Turán. Cand. J. Math., 17:533-540, 1965.
16. M. Pelillo. A unifying framework for relational structure matching. In A. K. Jain, S. Venkatesh, and B. C. Lovell, editors, Proc. 14th Int. Conf. Pattern Recognition, pages 1316-1319. IEEE-Computer Society Press, 1998.
17. M. Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11:1933-1955, 1999.
18. M. Pelillo. Matching free trees, maximal cliques, and monotone game dynamics. IEEE Trans. Pattern Anal. and Machine Intell., 24(11):1535-1541, 2002.
19. M. Pelillo, K. Siddiqi, and S. W. Zucker. Matching Hierarchical Structures Using Association Graphs. IEEE Trans. Pattern Anal. and Machine Intell., 21(11):1105-1120, 1999.
20. L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. and Machine Intell., 3:504-519, 1981.
21. W. H. Tsai and K. S. Fu. Subgraph error-correcting isomorphisms for syntactic pattern recognition. IEEE Trans. Syst. Man Cybern., 13:48-62, 1983.
22. R. C. Wilson and E. R. Hancock. Structural Matching by Discrete Relaxation. Trans. Pattern Anal. Machince Intell., 19(6):634-648, 1997.