{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:02:21Z","timestamp":1746244941629,"version":"3.40.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,3,22]],"date-time":"2014-03-22T00:00:00Z","timestamp":1395446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11280-014-0286-0","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:12:41Z","timestamp":1395393161000},"page":"871-887","source":"Crossref","is-referenced-by-count":2,"title":["Efficient subgraph join based on connectivity similarity"],"prefix":"10.1007","volume":"18","author":[{"given":"Yue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,22]]},"reference":[{"issue":"4","key":"286_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1(4), 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"key":"286_CR2","doi-asserted-by":"crossref","unstructured":"Cho, J., Shivakumar, N., Garcia-Molina H.: Finding Replicated Web Collections. SIGMOD Conf. pp. 355\u2013366 (2000)","DOI":"10.1145\/342009.335429"},{"key":"286_CR3","doi-asserted-by":"crossref","unstructured":"Cyr, C.M., Kimia, B.B.: 3D object recognition using shape similarity-based aspect graph. ICCV pp. 254\u2013261 (2001)","DOI":"10.1109\/ICCV.2001.937526"},{"issue":"1","key":"286_CR4","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Graph pattern matching: from intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"key":"286_CR5","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Wang, H., Wu, Y.: Graph homomorphism revisited for graph matching. VLDB 3(1), 1161\u20131172 (2010)","DOI":"10.14778\/1920841.1920986"},{"key":"286_CR6","doi-asserted-by":"crossref","unstructured":"Fankhauser, S., Riesen, K., Bunke, H.: Speeding up graph edit distance computation through fast bipartite matching. GbRPR pp. 102\u2013111 (2011)","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"286_CR7","doi-asserted-by":"crossref","unstructured":"Joshi, S.: A bag of paths model for measuring structural similarity in Web documents. KDD pp. 577\u2013582 (2003)","DOI":"10.1145\/956750.956822"},{"issue":"8","key":"286_CR8","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D Justice","year":"2006","unstructured":"Justice, D., Hero, A.O.: A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 28(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"286_CR9","first-page":"310","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4), 310\u2013321 (2011)","journal-title":"PVLDB"},{"key":"286_CR10","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: A versatile graph matching algorithm. ICDE pp. 117--128 (2002)"},{"issue":"3","key":"286_CR11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.-S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans Syst. Man Cybern."},{"issue":"3","key":"286_CR12","first-page":"1553","volume":"18","author":"A Schenker","year":"2004","unstructured":"Schenker, A., Last, M., Bunke, H., Kandel, A.: Classification of Web documents using graph matching. IJPRAI 18(3), 1553\u20131559 (2004)","journal-title":"IJPRAI"},{"key":"286_CR13","doi-asserted-by":"crossref","unstructured":"Shang, H., Lin, X., Zhang, Y., Yu, J.X., Wang, W.: Connected substructure similarity search. SIGMOD Conf. pp. 903\u2013914 (2010)","DOI":"10.1145\/1807167.1807264"},{"key":"286_CR14","doi-asserted-by":"crossref","unstructured":"Wang, G., Wang, B., Yang, X., Yu, G.: Efficiently indexing large sparse graphs for similarity search. IEEE Trans. Knowl. Data Eng. 24(3), 440--451 (2012)","DOI":"10.1109\/TKDE.2010.28"},{"key":"286_CR15","doi-asserted-by":"crossref","unstructured":"Williams, D. W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. ICDE pp. 976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"286_CR16","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. SIGMOD Conf. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"issue":"1","key":"286_CR17","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. PVLDB 2(1), 25\u201336 (2009)","journal-title":"PVLDB"},{"key":"286_CR18","unstructured":"Zeng, Z., Tung, A. K., Wang, J., Feng, J., Zhou, L.: Edit Distance Evaluation on Graph Structures. Technical Report TRA6\/08. National University of Singapore ( 2008)"},{"key":"286_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, X., Xiao, C., Lin, X., Wang, W.: Efficient graph similarity joins with edit distance constraints. ICDE pp. 834--845 (2012)","DOI":"10.1109\/ICDE.2012.91"},{"key":"286_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Qin, L., Yu, J. X., Ke, Y., Lin, X.: High efficiency and quality: large graphs matching. CIKM pp. 1755\u20131764 (2011)","DOI":"10.1145\/2063576.2063831"},{"key":"286_CR21","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distance-join: pattern match query in a large graph databases. VLDB 2(1), 886--897 (2009)","DOI":"10.14778\/1687627.1687727"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0286-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-014-0286-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0286-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:45:34Z","timestamp":1746157534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-014-0286-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,22]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s11280-014-0286-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2014,3,22]]}}}