Reducing the bottleneck of graph-based data mining by improving the efficiency of labeled graph isomorphism testing

Kuramochi, 2004, An efficient algorithm for discovering frequent subgraphs, IEEE Trans. Knowl. Data Eng., 16, 1038, 10.1109/TKDE.2004.33 Wu, 2012, Hidden relationship between conserved residues and locally conserved phosphate-binding structures in NAD(P)-binding proteins, J. Phys. Chem. B, 116, 5644, 10.1021/jp3014332 Childs, 2009, Identification and classification of ncRNA molecules using graph properties, Nucleic Acids Res., 37, e66, 10.1093/nar/gkp206 Ledouxa, 2011, Topologically consistent 3D city models obtained by extrusion, Int. J. Geogr. Inf. Sci., 25, 557, 10.1080/13658811003623277 Hsieh, 2008, Graph-based representation for similarity retrieval of symbolic images, Data Knowl. Eng., 65, 401, 10.1016/j.datak.2007.12.004 Omar, 2012, Integrating spatial decision support system with graph mining technique, 15 Petrakis, 2002, ImageMap: an image indexing method based on spatial similarity, IEEE Trans. Knowl. Data Eng., 14, 979, 10.1109/TKDE.2002.1033768 Huan, 2003, Efficient mining of frequent subgraph in the presence of isomorphism Inokuchi, 2003, Complete mining of frequent patterns from graphs: mining graph data, Mach. Learn., 50, 321, 10.1023/A:1021726221443 Yan, 2002, gSpan: graph-based substructure pattern mining Chartrand, 2002 2004 Kukluk, 2004, Algorithm and experiments in testing planar graphs for isomorphism, J. Graph Algoritm. Appl., 18, 313, 10.7155/jgaa.00094 Jenner, 2003, Completeness results for graph isomorphism, J. Comput. Syst. Sci., 66, 549, 10.1016/S0022-0000(03)00042-4 Aho, 1974 Hopcroft, 1974, Linear time algorithm for isomorphism of planar graphs, 172 Galil, 1987, An O(n3log n) Las Vegas isomorphism test for trivalent graphs, J. ACM, 34, 513, 10.1145/28869.28870 Conte, 2004, Thirty years of graph matching in pattern recognition, Int. J. Pattern Recognit. Artif. Intell., 18, 265, 10.1142/S0218001404003228 Cordella, 2004, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Trans. Pattern Anal. Mach. Intell., 26, 1367, 10.1109/TPAMI.2004.75 Foggia, 2001, A performance comparison of five algorithms for graph isomorphism McKay, 1981, Practical graph isomorphism, Congr. Numer., 30, 45 McKay Washio, 2003, State of the art of graph-based data mining, ACM SIGKDD Explor. Newsl., 5, 59, 10.1145/959242.959249 Ullmann, 1976, An algorithm for subgraph isomorphism, J. ACM, 23, 31, 10.1145/321921.321925 De Santo, 2003, A large database of graphs and its use for benchmarking graph isomorphism algorithms, Pattern Recogn. Lett., 24, 1067, 10.1016/S0167-8655(02)00253-2 Neapolitan, 1996 Valiente, 2004, Trading uninitialized space for time, Inf. Process. Lett., 9, 10.1016/j.ipl.2004.06.002