Approach for efficient subgraph isomorphism testing for multiple graphs

Ruan Jian Xue Bao/Journal of Software

Volumn 21, Issue 3, 2010, Pages 401-414

  Zhang, Shuo ^a   Li, Jian Zhong ^a   Gao, Hong ^a   Zou, Zhao Nian ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Graph indexing; Graph matching; Preprocessing; Subgraph isomorphism

Indexed keywords

COMPUTATIONAL COSTS; CONSTRUCTION TIME; EXISTING METHOD; GRAPH INDEXING; GRAPH MATCHINGS; LARGE GRAPHS; LOOK-AHEAD; ORDER OF MAGNITUDE; STATE-OF-THE-ART METHODS; SUBGRAPH ISOMORPHISM;

COMPUTATIONAL EFFICIENCY; COST REDUCTION; GRAPHIC METHODS; INDEXING (OF INFORMATION); PATTERN MATCHING;

SET THEORY;

EID: 77951012568     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1001.2010.03478     Document Type: Article

References (17)

1. Conte D, Foggia P, Sansone C, Vento M. Thirty years of graph matching in pattern recognition. Int'l Journal of Pattern Recognition and Artificial Intelligence, 2004, 18(3): 265-298.
2. Cordella LP, Foggia P, Sansone C, Vento M. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2004, 26(10): 1367-1372.
3. Ullmann JR. An algorithm for subgraph isomorphism. Journal of the ACM, 1976, 23(1): 31-42.
4. Sengupta K, Boyer KL. Organizing large structural model bases. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1995, 17(4): 321-332.
5. Messmer BT, Bunke H. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition, 1999, 32(12): 1979-1998.
6. Messmer BT, Bunke H. Efficient subgraph isomorphism detection: A decomposition approach. IEEE Trans. on Knowledge and Data Engineering, 2000, 12(2): 307-323.
7. Chen C, Yan X, Yu PS, Han J, Zhang DQ, Gu X. Towards graph containment search and indexing. In: Koch C, Gehrke J, Garofalakis MN, Srivastava D, Aberer K, Deshpande A, Florescu D, Chan CY, Ganti V, Kanne CC, Klas W, Neuhold EJ, eds. Proc. of the Int'l Conf. on Very Large Data Bases. Vienna: ACM, 2007. 926-937.
8. Zhou SG, Yu ZC, Jiang HL. Concepts, issues, and advances of searching in graph-structured data. Communications of the China Computer Federation, 2007, 3(8): 59-65 (in Chinese with English abstract).
9. Yan X, Yu PS, Han J. Graph indexing: A frequent structure-based approach. In: Weikum G, Konig AC, Dessloch S, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Paris: ACM, 2004. 335-346.
10. Cheng J, Ke Y, Ng W, Lu A. FG-Index: Towards verification-free query processing on graph databases. In: Chan CY, Ooi BC, Zhou A, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Beijing: ACM, 2007. 857-872.
11. Washio T, Motoda H. State of the art of graph-based data mining. SIGKDD Explorations, 2003, 5(1): 59-68.
12. Yan X, Han J. gSpan: Graph-Based substructure pattern mining. In: Agrawal R, Dittrich K, Ngu AHH, eds. Proc. of the IEEE Int'l Conf. on Data Mining. Maebashi City: IEEE, 2002. 721-724.
13. Wang W, Zhou HF, Yuan QQ, Lou YB, Shi BL. Mining frequent patterns based on graph theory. Journal of Computer Research and Development, 2005, 42(2): 230-235 (in Chinese with English abstract).
14. Li XT, Li JZ, Gao H. An efficient frequent subgraph mining algorithm. Journal of Software, 2007, 18(10): 2469-2480 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/2469.htm
15. Liu Y, Li J, Gao H. Summarizing graph patterns. In: Bernstein P, Bertino E, Dayal U, Lockemann P, Weikum G, Whang KY, eds. Proc. of the IEEE Int'l Conf. on Data Mining. Cancun: IEEE, 2008. 903-912.
16. Fürer M, Raghavachari B. Approximating the minimum degree spanning tree to within one from the optimal degree. In: Smithies M, ed. Proc. of the ACM/SIGACT-SIAM Symp. on Discrete Algorithms. Orlando: SIAM, 1992. 317-324.
17. Tatarinov I, Viglas S, Beyer KS, Shanmugasundaram J, Shekita EJ, Zhang C. Storing and querying ordered XML using a relational database system. In: Franklin MJ, Moon B, Ailamaki A, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Madison: ACM, 2002. 204-215.