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.
Research sponsored by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory, managed by UT-Battelle, LLC, for the U. S. Department of Energy under Contract DE–AC05–00OR22725, by the U.S. National Science Foundation under grant CCR–0311500, by the Office of Naval Research under grant N00014–01–1–0608, and by the U.S. Department of Energy’s Genomes to Life program under the ORNL-PNNL project “Exploratory Data Intensive Computing for Complex Biological Systems.”
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Communications of the ACM 16, 575–577 (1973)
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)
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)
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)
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)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
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)
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)
Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science 250, 1–30 (2001)
Krissinel, E.B., Henrick, K.: Common subgraph isomorphism detection by backtracking search. Software Practice and Experience 34, 591–607 (2004)
Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9, 341–352 (1972)
Massaro, A., Pelillo, M.: Matching graphs by pivoting. Pattern Recognition Letters 24(8), 1099–1106 (2003)
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)
McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience 12, 23–34 (1982)
Messmer, B.T.: Efficient Graph Matching Algorithms for Preprocessed Model Graphs. Phd, University of Bern (1995)
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)
Robson, J.M.: Finding a maximum independent set in time O(2n/4). Technical Report 1251- 01, Universite Bordeaux I, LaBRI (2001)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suters, W.H., Abu-Khzam, F.N., Zhang, Y., Symons, C.T., Samatova, N.F., Langston, M.A. (2005). A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_73
Download citation
DOI: https://doi.org/10.1007/11533719_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)