Abstract
We present a novel approach to the problem of finding all subgraphs and induced subgraphs of a (target) graph which are isomorphic to another (pattern) graph. To attain efficiency we use a special representation of the pattern graph. We also combine our search algorithm with some known bisection algorithms. Experimental comparison with other algorithms was performed on several types of graphs. The comparison results suggest that the approach provided here is most effective when all instances of a subgraph need to be found.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Akinniyi FA, Wong AKC, Stacey DA (1986) A new algorithm for graph monomorphism based on the projections of the product graph. Trans Systems, Man and Cybernetics SMC-16: 740–751
Alon N, Yuster R, Zwick U (1995) Color-coding Electronic colloquium on computational complexity (ECCC). 1(009), 1994. Full paper appears in J ACM 42(4): 44–856
Ambauen R, Fischer S, Bunke H (2003) Graph edit distance with node splitting and merging, and its application to diatom identification. Lecture notes in computer science, vol 2726, pp 259–264
Bunke H, Messmer BT (2000) Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans Knowl Data Eng 12: 307–323
Batz GV (2006) An optimization technique for subgraph matching strategies. Technical report 2006–2007, Universitat Karlsruhe, Faculty of Informatik
Berretti S, Del Bimbo A, Pala P (2004) A graph edit distance based on node merging. In: Proceedings of CIVR2004, pp 464–472
Boeres M, Ribeiro C, Bloch I (2004) A randomized heuristic for scene recognition by graph matching. In: Proceedings of WEA 2004, pp 100–113
Cai D, Shao Z, He X, Yan X, Han J (2005) Mining hidden community in heterogeneous social networks. In: Proceedings of the 3rd international workshop on link discovery, pp 58–65
Champin P, Solnon C (2003) Measuring the similarity of labeled graphs. Conference on case-based reasoning (ICCBR), pp 100–113
Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2): 209–221
Cheng JK, Huang TS (1981) A subgraph isomorphism algorithm using resolution. Pattern Recognit 13: 371–379
Cordella LP, Foggia P, Sansone C, Vento M (1999) Performance evaluation of the vf graph matching algorithm. In: Proceedings of ICIAP 1999, pp 1172–1177
Cortadella J, Valiente G (2000) A relational view of subgraph isomorphism. In: Proceedings of fifth international seminar on relational methods in computer science, pp 45–54
Dehaspe L, Toivonen H, King RD (1998) Finding frequent substructures in chemical compounds. In: Proceedings of the 4th international conference on knowledge discovery and data mining (KDD-98), pp 30–36
Dessmark A, Lingas A, Proskurowski A (2000) Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Algorithmica 27(3): 337–347
Eppstein D (1999) Subgraph isomorphism in planar graphs and related problems. J Graph Algorithms & Appl 3(3): 1–27
Erdoös P, Renyi A (1959) On random graphs. I. Publicationes Mathematicae 6: 290–297
Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 workshop on graph-based representations. Lecture Notes in Computer Science, Ischia
Garey MR, Johnson DS (1979) Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman
Gudes E, Shimony SE, Vanetik N (2006) Discovering frequent graph patterns using disjoint paths. IEEE Trans Knowl Data Eng 18(11): 1441–1456
Krissinel EB, Henrick K (2004) Common subgraph isomorphism detection by backtracking search. Softw Prac Exp 34(6): 591–607
Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of ICDM 2001
Kuramochi M, Karypis G (2004) Finding frequent patterns in a large sparse graph. In: Proceedings of SDM 2004
Larrosa J, Valiente G (2000) Graph pattern matching using constraint satisfaction. In: Proceedings of joint APPLIGRAPH/GETGRATS workshop of graph transformation systems, pp 189–196
Lin X, Liu Ch, Zhang Y, Zhou X (1998) Efficiently computing frequent tree-like topology patterns in a web environment. In: Proceedings of 31st International conference on technology of object-oriented land systems
Lingas A, Sysło MM (1989) A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. Technical report LiTH-IDA-R-89-05, Linköping University, Department of Computer and Information Science
Matula DW (1978) Subtree isomorphism in O(n 5/2). Ann Discrete Math 2: 91–106
Messmer BT, Bunke H (1996) Subgraph isomorphism detection in polynomial time on preprocessed model graphs. In: Proceedings of 2nd Asian conference on computer vision. springer, pp 373–382
NCI (2008) Database of interacting proteins. Technical report. Available at http://dtp.nci.nih.gov
Nijssen S, Kok JN (2004a) Frequent graph mining and its application to molecular databases. In: Proceedings of the IEEE international conference on systems, man and cybernetics, SMC 2004, Den Haag, Netherlands, October 10–13, 2004. IEEE Press
Nijssen S, Kok JN (2004b) A quickstart in frequent structure mining can make a difference. In: Kohavi R, Gehrke J, DuMouchel W, Ghosh J (eds) Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, KDD2004, Seattle, USA, August 22–25, 2004, pp 647–652. ACM Press
Pennec X, Ayache N (1998) A geometric algorithm to find small but highly similar 3d substructure s in proteins. Bioinformatics 14(6): 516–522
Sammoud O, Solnon C, Ghédira K (2005) Ant algorithm for the graph matching problem. In: Proceedings of EvoCOP 2005, pp 213–223
Sansone C (2001) Graph database library for subgraph isomorphism. Technical report. Available at http://amalfi.dis.unina.it/graph/
Sansone C, Cordella LP, Foggia P, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10): 1367–1372
SIVALab of the University of Naples (2003) Arg graph database. Technical report. Available at http://amalfi.dis.unina.it/graph/
Ullmann JR (1976) An algorithm for subgraph isomorphism. J Assoc Comput Mach 23: 31–42
Vanetik N, Gudes E, Shimony SE (2002) Computing frequent graph patterns from semistructured data. In: Proceedings of ICDM 2002, pp 458–465
Wang K, Liu H (1998) Discovering typical structures of documents: a road map approach. In: Proceedings of SIGIR 1998, pp 146–154
Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of ICDM 2002, pp 721–724
Zhang S, Li S, Yang J (2009) Gaddi: distance index based subgraph matching in biological networks. In: Proceedings of EDBT conference 2009
Author information
Authors and Affiliations
Corresponding author
Additional information
Responsible editor: Charles Elkan.
Rights and permissions
About this article
Cite this article
Lipets, V., Vanetik, N. & Gudes, E. Subsea: an efficient heuristic algorithm for subgraph isomorphism. Data Min Knowl Disc 19, 320–350 (2009). https://doi.org/10.1007/s10618-009-0132-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10618-009-0132-7