The maximum common subgraph problem: Faster solutions via vertex cover

2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007

Volumn , Issue , 2007, Pages 367-373

  Abu Khzam, Faisal N ^a   Samatova, Nagiza F ^b   Rizk, Mohamad A ^a   Langston, Michael A ^c  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY;

MAXIMUM COMMON SUBGRAPH (MCS); SEARCH PROCESS; VERTEX COVER;

PROBLEM SOLVING;

EID: 36248947260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AICCSA.2007.370907     Document Type: Conference Paper

References (15)

1. F. N. Abu-Khzam, M. A. Langston, P. Shanbhag, and C. T. Symons. Scalable parallel algorithms for FPT problems. Algorithmica, 45:269-284, 2006.
2. C. Bron and J. Kerbosch. Finding all cliques of an undirected graph. Communications of the ACM, 16:575-577, 1973.
3. 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.
4. J. Chen, I. Kanj, and G. Xia. Improved parameterized upper bounds for vertex cover. In 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Lecture Notes in Computer, volume 4162, pages 238-249, 2006.
5. 1-o(1). In 27th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, volume 1853, pages 2-12. Springer-Verlag, Geneva, 2000.
6. 1-ε. In Proc. 37th Ann. Symp. Found. Comput. Sci., pages 627-636, 1996.
7. E. B. Krissinel and K. Henrick. Common subgraph isomorphism detection by backtracking search. Software Practice and Experience, 34:591-607, 2004.
8. A. Massaro and M. Pelillo. Matching graphs by pivoting. Pattern Recognition Letters, 24(8): 1099-1106, 2003.
9. 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.
10. 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.
11. J. M. Robson. Finding a maximum independent set in time O(2n/4). Technical Report 1251-01, Universite Bordeaux I, LaBRI, 2001.
12. W. Henry Suters, F. N. Abu-Khzam, Y. Zhang, C. T. Symons, N. F. Samatova, and M. A. Langsten. A new approach and faster exact methods for the maximum common subgraph problem. In 11th International Computing and Combinatorics Conference, Kunming, China, Lecture Notes in Computer Science, volume 3595, pages 717-727. Springer, August 2005.
13. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques. In Computing and Combinatorics Conference (COCOON), August 2004.
14. J. R. Ullman. An algorithm for subgraph isomorphism. Journal of the ACM, 23(1):31-42, 1976.
15. 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.