A new approach and faster exact methods for the maximum common subgraph problem

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 717-727

  Suters, W Henry ^a   Abu Khzam, Faisal N ^b   Zhang, Yun ^c   Symons, Christopher T ^d   Samatova, Nagiza F ^d   Langston, Michael A ^c  

^a Carson Newman College   (United States)

^b LEBANESE AMERICAN UNIVERSITY   (Lebanon)

^c University of Tennessee   (United States)

^d OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMBINATORIAL MATHEMATICS;

ASSOCIATION GRAPH; MAXIUM COMMON SUBGRAPH (MCS); PRODUCT GRAPH; EXACT METHODS; FORM OF PRODUCTS; INDUCED SUBGRAPHS; MAXIMUM CLIQUE; MAXIMUM COMMON SUBGRAPH; NEW APPROACHES; SPECIAL STRUCTURE;

GRAPH THEORY; ALGORITHMS;

EID: 26844545867     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_73     Document Type: Conference Paper

References (23)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proceedings, Workshop on Algorithm Engineering and Experiments (ALENEX), 2004.
2. F. N. Abu-Khzam, M. A. Langston, and P. Shanbhag. Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. In Proceedings, International Conference on Parallel and Distributed Computing and Systems (PDCS), pages 563-568, 2003.
3. F. N. Abu-Khzam, M. A. Langston, and W. H. Suters. Effective vertex cover kernelization: A tale of two algorithms. In Proceedings, ACS/IEEE International Conference on Computer Systems and Applications (AICCSA), 2005.
4. T. Akutsu. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals, E76-A:1488-1493, 1993.
5. I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo. The maximum clique problem. In D. Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 4. Boston MA: Kluwer Academic Publishers, 1999.
6. C. Bron and J. Kerbosch. Finding all cliques of an undirected graph. Communications of the ACM, 16:575-577, 1973.
7. H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, and M. Vento. A comparison of algorithms for maximum common subgraph on randomly connected graphs. In Proc. IAPR Workshop on Structural and Syntactic Pattern Recognition, 2002.
8. K. Shearer H. Bunke and S. Venkatesh. Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition, 34:1075-1091, 2001.
9. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 18(3):265-298, 2004.
10. D. Conte, C. Guidobaldi, and C. Sansone. A comparison of three maximum common subgraph algorithms on a large database of labeled graphs. In E. Hancock and M. Vento, editors, IAPR Workshop GbRPR2003, LNCS 2726, pages 130-141, 2003.
11. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
12. P.J. Durand, R. Pasari, J.W. Baker, and Chun che Tsai. An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry, 2, 1999.
13. V. Kann. On the approximability of the maximum common subgraph problem. In STACS'92: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, pages 377-388. Springer-Verlag, 1992.
14. I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science, 250:1-30, 2001.
15. E. B. Krissinel and K. Henrick. Common subgraph isomorphism detection by backtracking search. Software Practice and Experience, 34:591-607, 2004.
16. G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341-352, 1972.
17. A. Massaro and M. Pelillo. Matching graphs by pivoting. Pattern Recognition Letters, 24(8):1099-1106, 2003.
18. J. McGregor and P.Willett. Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions. Journal of Chemical Information and Computer Science, 21:137-140, 1981.
19. J. J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, 12:23-34, 1982.
20. B. T. Messmer. Efficient Graph Matching Algorithms for Preprocessed Model Graphs. Phd, University of Bern, 1995.
21. J.W. Raymond and P.Willett. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design, 16:521-533, 2002.
22. J. M. Robson. Finding a maximum independent set in time O(2n/4). Technical Report 1251-01, Universite Bordeaux I, LaBRI, 2001.
23. A. Yamaguchi, K. F. Aoki, and H. Mamitsuka. Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. Information Processing Letters, 92(2):57-63, 2004.