Advertisement

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

  • W. Henry Suters
  • Faisal N. Abu-Khzam
  • Yun Zhang
  • Christopher T. Symons
  • Nagiza F. Samatova
  • Michael A. Langston
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3595)

Abstract

The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the problem of finding a maximum clique in the order mn association graph, which is a particular form of product graph built from the inputs. In this paper a new algorithm, termed “clique branching,” is proposed that exploits a special structure inherent in the association graph. This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1) n ) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • W. Henry Suters
    • 1
  • Faisal N. Abu-Khzam
    • 2
  • Yun Zhang
    • 3
  • Christopher T. Symons
    • 4
  • Nagiza F. Samatova
    • 4
  • Michael A. Langston
    • 3
  1. 1.Department of Mathematics and Computer ScienceCarson-Newman CollegeJefferson CityUSA
  2. 2.Division of Computer Science and MathematicsLebanese American UniversityBeirutLebanon
  3. 3.Department of Computer ScienceUniversity of TennesseeKnoxvilleUSA
  4. 4.Computer Science and Mathematics DivisionOak Ridge National LaboratoryOak RidgeUSA

Personalised recommendations